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

Articles table of contents

Results : 76-82/82
Combinatorial pattern matching 1992
Authors: Manber
Journal: SIGACT news
Citation: Manber, Combinatorial pattern matching 1992, SIGACT news , 23(3), 1992, pp. 95-97
DIMACS, the stuctures conference researc abstracts
Authors:
Journal: SIGACT news
Citation: , DIMACS, the stuctures conference researc abstracts, SIGACT news , 23(4), 1992, pp. 95-96
On RAT(infinity)
Authors: Litow
Journal: SIGACT news
Citation: Litow, On RAT(infinity), SIGACT news , 23(3), 1992, pp. 98-99
CAC-NET, new CS Dept. at university of Rome, Slovak institute for informatics, obituary
Authors:
Journal: SIGACT news
Citation: , CAC-NET, new CS Dept. at university of Rome, Slovak institute for informatics, obituary, SIGACT news , 23(2), 1992, pp. 98-98
A bound on the shift function in terms of the busy beaver function
Authors: Julstrom
Journal: SIGACT news
Citation: Julstrom, A bound on the shift function in terms of the busy beaver function, SIGACT news , 23(3), 1992, pp. 100-106
How reductions to sparse sets collapse the polynomial time hierarchy: a primer. Part I:Polynomial-time Turing reductions
Authors: Young
Journal: SIGACT news
Citation: Young, How reductions to sparse sets collapse the polynomial time hierarchy: a primer. Part I:Polynomial-time Turing reductions, SIGACT news , 23(3), 1992, pp. 107-117
ACM self-assessment committee
Authors: DIMACS
Journal: SIGACT news
Citation: Dimacs, ACM self-assessment committee, SIGACT news , 23(3), 1992, pp. 118-120
Results: 1-25 | 26-50 | 51-75 | 76-82