string(238) "select * FROM articoli_opac WHERE fonte <> 'ISI' AND fonte='ACNP' AND fasc_anno_pubbl='1994' AND fasc_issn='01635700' order by level desc, fasc_key desc, NULLIF(regexp_replace(pagina_ini, E'\\D', '', 'g'), '')::int asc offset 50 limit 25" ACNP - Italian Periodicals Catalogue
Results: 1-25 | 26-50 | 51-75 | 76-79    

Articles table of contents

Results : 51-75/79

Authors:
Journal: SIGACT news
Citation: , Calls for papers and partecipation, SIGACT news , 25(3), 1994, pp. 66-83

Authors:
Journal: SIGACT news
Citation: , Conference programs and information, SIGACT news , 25(1), 1994, pp. 68-77

Authors:
Journal: SIGACT news
Citation: , Conference programs and information, SIGACT news , 25(4), 1994, pp. 77-83

Authors: Salowe
Journal: SIGACT news
Citation: Salowe, Theory calendar, SIGACT news , 25(1), 1994, pp. 78-81

Authors: Salowe
Journal: SIGACT news
Citation: Salowe, Theory calendar, SIGACT news , 25(2), 1994, pp. 79-82

Authors: Fenner
Journal: SIGACT news
Citation: Fenner, First maine Workshop in structural complexity, SIGACT news , 25(1), 1994, pp. 82-83

Authors: Bloch,Buss,Goldsmith
Journal: SIGACT news
Citation: Bloch,buss,goldsmith, How hard are n^2 - hard problems?, SIGACT news , 25(2), 1994, pp. 83-85

Authors: Ganley
Journal: SIGACT news
Citation: Ganley, Theory calendar, SIGACT news , 25(4), 1994, pp. 84-86

Authors: Ganley
Journal: SIGACT news
Citation: Ganley, Theory calendar, SIGACT news , 25(4), 1994, pp. 84-8624

Authors:
Journal: SIGACT news
Citation: , Conference programs and information, SIGACT news , 25(3), 1994, pp. 84-91

Authors: Raman
Journal: SIGACT news
Citation: Raman, 9th Maryland theory day, SIGACT news , 25(1), 1994, pp. 84-86

Authors: Raman
Journal: SIGACT news
Citation: Raman, A simpler analysis of algorithm 65 (Find), SIGACT news , 25(2), 1994, pp. 86-89

Authors: Ben-Amran
Journal: SIGACT news
Citation: Ben-amran, Alcom summer scool on complexity, SIGACT news , 25(4), 1994, pp. 87-87

Authors: Fortnow,Kurtz,Whang
Journal: SIGACT news
Citation: Fortnow,kurtz,whang, The infinite version of an Open Communication Complexity problem is indipendent of the Axioms of Set theory, SIGACT news , 25(1), 1994, pp. 87-89

Authors: Zeugmann
Journal: SIGACT news
Citation: Zeugmann, COLT 94, SIGACT news , 25(4), 1994, pp. 88-91

Authors: Matos
Journal: SIGACT news
Citation: Matos, An introduction to Ultimately Periodic Sets of integers, SIGACT news , 25(1), 1994, pp. 90-96

Authors: Rocha Costa",Rodrigues
Journal: SIGACT news
Citation: Rocha Costa",rodrigues, Inspecting continuations, SIGACT news , 25(2), 1994, pp. 90-91

Authors:
Journal: SIGACT news
Citation: , Sloan Fellowships, DIMACS special year, SIGACT news , 25(2), 1994, pp. 92-96

Authors: Longpré
Journal: SIGACT news
Citation: Longpré, Structures 1994, SIGACT news , 25(4), 1994, pp. 92-95

Authors: Salowe
Journal: SIGACT news
Citation: Salowe, Theory calendar, SIGACT news , 25(3), 1994, pp. 92-93

Authors: Fraser
Journal: SIGACT news
Citation: Fraser, Fifth international symposium on combinatorial pattern matching, SIGACT news , 25(3), 1994, pp. 94-96

Authors: Parberry
Journal: SIGACT news
Citation: Parberry, A form for referees in theoretical computer science, SIGACT news , 25(4), 1994, pp. 96-107

Authors: Sorenson
Journal: SIGACT news
Citation: Sorenson, 30th Midwest theory day, SIGACT news , 25(3), 1994, pp. 97-100

Authors: Longpré
Journal: SIGACT news
Citation: Longpré, Structures 1994, SIGACT news , 25(3), 1994, pp. 101-101

Authors: Petersen
Journal: SIGACT news
Citation: Petersen, Two-Way One-Counter automata accepting bounded languages, SIGACT news , 25(3), 1994, pp. 102-105
Results: 1-25 | 26-50 | 51-75 | 76-79