Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=1099

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Fixpoints for Rabin tree automata make complementation easy
Roope Kaivola
Lecture Notes in Computer Science 1099, 1996, pp. 312-323
New upper bounds to the limitedness of distance automata
Kosaburo Hashiguchi
Lecture Notes in Computer Science 1099, 1996, pp. 324-335
Recognizing regular expressions by means of dataflow networks
Pascal Raymond
Lecture Notes in Computer Science 1099, 1996, pp. 336-347
On the power of randomized branching programs
Farid Ablayev, Marek Karpinski
Lecture Notes in Computer Science 1099, 1996, pp. 348-356
Hitting sets derandomize BPP
Alexander E. Andreev, Andrea E.F. Clementi, José D.P. Rolim
Lecture Notes in Computer Science 1099, 1996, pp. 357-368
On type-2 probabilistic quantifiers
Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
Lecture Notes in Computer Science 1099, 1996, pp. 369-380
Speeding-up single-tape nondeterministic computations by single alternation, with separation results
Jiȓí Wiedermann
Lecture Notes in Computer Science 1099, 1996, pp. 381-392
On \omega-generators and codes
Sandrine Julia
Lecture Notes in Computer Science 1099, 1996, pp. 393-402
On standard Sturmian morphisms
Aldo de Luca
Lecture Notes in Computer Science 1099, 1996, pp. 403-415
Constructions and bounds for visual cryptography
Giuseppe Ateniese, Carlo Blundo, Alfredo de Santis, Douglas R. Stinson
Lecture Notes in Computer Science 1099, 1996, pp. 416-428
On capital investment
Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
Lecture Notes in Computer Science 1099, 1996, pp. 429-441
Lower bounds for static dictionaries on RAMs with bit operations but no multiplication
Peter Bro Miltersen
Lecture Notes in Computer Science 1099, 1996, pp. 442-453
Lower bounds for row minima searching
Phillip G. Bradford, Knut Reinert
Lecture Notes in Computer Science 1099, 1996, pp. 454-465
On the complexity of relational problems for finite state processes
Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard E. Stearns
Lecture Notes in Computer Science 1099, 1996, pp. 466-477
Deciding finiteness of Petri nets up to bisimulation
Petr Janc̑ar, Javier Esparza
Lecture Notes in Computer Science 1099, 1996, pp. 478-489
Mobile processes with a distributed environment
Chiara Bodei, Pierpaolo Degano, Corrado Priami
Lecture Notes in Computer Science 1099, 1996, pp. 490-501
The meaning of negative premises in transition system specifications II
R.J. van Glabbeek
Lecture Notes in Computer Science 1099, 1996, pp. 502-513
Average case analyses of list update algorithms, with applications to data compression
Susanne Albers, Michael Mitzenmacher
Lecture Notes in Computer Science 1099, 1996, pp. 514-525
Self-organizing data structures with dependent accesses
Frank Schulz, Elmar Schömer
Lecture Notes in Computer Science 1099, 1996, pp. 526-537
Lopsided trees: Analyses, algorithms, and applications
Vicky Siu-Ngan Choi, Mordecai Golin, M. Golin
Lecture Notes in Computer Science 1099, 1996, pp. 538-549
Optimal logarithmic time randomized suffix tree construction
Martin Farach, S. Muthukrishnan
Lecture Notes in Computer Science 1099, 1996, pp. 550-561
Improved parallel approximation of a class of integer programming problems
Noga Alon, Aravind Srinivasan
Lecture Notes in Computer Science 1099, 1996, pp. 562-573
Efficient collective communication in optical networks
J.-C. Bermond, L. Gargano, S. Perennes, A.A. Rescigno, U. Vaccaro
Lecture Notes in Computer Science 1099, 1996, pp. 574-585
Shared-memory simulations on a faulty-memory DMM
Bogdan S. Chlebus, Anna Gambin, Piotr Indyk
Lecture Notes in Computer Science 1099, 1996, pp. 586-597
Fast deterministic backtrack search
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Lecture Notes in Computer Science 1099, 1996, pp. 598-609

Seiten < 1 2 3 >