Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1893

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

Region analysis and a \pi -calculus with groups
Silvano Dal Zilio, Andrew D. Gordon
Lecture Notes in Computer Science 1893, 2000, pp. 1-20
Abstract data types in computer algebra
James H. Davenport
Lecture Notes in Computer Science 1893, 2000, pp. 21-35
What do we learn from experimental algorithmics?
Camil Demetrescu, Giuseppe F. Italiano
Lecture Notes in Computer Science 1893, 2000, pp. 36-51
And/or hierarchies and round abstraction
Radu Grosu
Lecture Notes in Computer Science 1893, 2000, pp. 52-63
Computational politics: Electoral systems
Edith Hemaspaandra, Lane A. Hemaspaandra
Lecture Notes in Computer Science 1893, 2000, pp. 64-83
0-1 laws for fragments of existential second-order logic: A survey
Phokion G. Kolaitis, Moshe Y. Vardi
Lecture Notes in Computer Science 1893, 2000, pp. 84-98
On algorithms and interaction
Jan van Leeuwen, Jiȓí Wiedermann
Lecture Notes in Computer Science 1893, 2000, pp. 99-113
On the use of duality and geometry in layouts for ATM networks
Shmuel Zaks
Lecture Notes in Computer Science 1893, 2000, pp. 114-131
On the lower bounds for one-way quantum automata
Farid Ablayev, Aida Gainutdinova
Lecture Notes in Computer Science 1893, 2000, pp. 132-140
Axiomatizing fully complete models for ML polymorphic types
Samson Abramsky, Marina Lenisa
Lecture Notes in Computer Science 1893, 2000, pp. 141-151
Measure theoretic completeness notions for the exponential time classes
Klaus Ambos-Spies
Lecture Notes in Computer Science 1893, 2000, pp. 152-161
Edge-bisection of chordal rings
Lali Barrière, Josep Fàbrega
Lecture Notes in Computer Science 1893, 2000, pp. 162-171
Equation satisfiability and program satisfiability for finite monoids
David Mix Barrington, Pierre McKenzie, Cris Moore, Pascal Tesson, Denis Thérien
Lecture Notes in Computer Science 1893, 2000, pp. 172-181
XML grammars
Jean Berstel, Luc Boasson
Lecture Notes in Computer Science 1893, 2000, pp. 182-191
Simplifying flow networks
Therese C. Biedl, Brȏna Brejová, Tomás̑ Vinaȓ
Lecture Notes in Computer Science 1893, 2000, pp. 192-201
Balanced k-colorings
Therese C. Biedl, Eowyn C̑enek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-Wei Wang
Lecture Notes in Computer Science 1893, 2000, pp. 202-211
A compositional model for confluent dynamic data-flow networks
Frank S. de Boer, Marcello M. Bonsangue
Lecture Notes in Computer Science 1893, 2000, pp. 212-221
Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
Beate Bollig
Lecture Notes in Computer Science 1893, 2000, pp. 222-231
Expressiveness of updatable timed automata
P. Bouyer, C. Dufourd, E. Fleury, A. Petit
Lecture Notes in Computer Science 1893, 2000, pp. 232-242
Iterative arrays with small time bounds
Thomas Buchholz, Andreas Klein, Martin Kutrib
Lecture Notes in Computer Science 1893, 2000, pp. 243-252
Embedding Fibonacci cubes into hypercubes with \Omega (2^{cn}) faulty nodes
Rostislav Caha, Petr Gregor
Lecture Notes in Computer Science 1893, 2000, pp. 253-263
Periodic-like words
Arturo Carpi, Aldo de Luca
Lecture Notes in Computer Science 1893, 2000, pp. 264-274
The monadic theory of morphic infinite words and generalizations
Olivier Carton, Wolfgang Thomas
Lecture Notes in Computer Science 1893, 2000, pp. 275-284
Optical routing of uniform instances in tori
Francesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny
Lecture Notes in Computer Science 1893, 2000, pp. 285-294
Factorizing codes and Schützenberger conjectures
Clelia De Felice
Lecture Notes in Computer Science 1893, 2000, pp. 295-303

Seiten 1 2 3 >