Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=349

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

On genuinely time bounded computations
Friedhelm Meyer auf der Heide
Lecture Notes in Computer Science 349, 1989, pp. 1-16
Unified algebras and action semantics
Peter D. Mosses
Lecture Notes in Computer Science 349, 1989, pp. 17-35
Properties of infinite words: Recent results
J. Berstel
Lecture Notes in Computer Science 349, 1989, pp. 36-46
A first order logic for partial functions
Francisca Lucio-Carrasco, Antonio Gavilanes-Franco
Lecture Notes in Computer Science 349, 1989, pp. 47-58
Observational implementations
Rolf Hennicker
Lecture Notes in Computer Science 349, 1989, pp. 59-71
On the boundary of a union of rays
Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
Lecture Notes in Computer Science 349, 1989, pp. 72-83
Dynamic planar point location with optimal query time
Franco P. Preparata, Roberto Tamassia
Lecture Notes in Computer Science 349, 1989, pp. 84-95
An O(n \log n) algorithm for computing a link center in a simple polygon
Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
Lecture Notes in Computer Science 349, 1989, pp. 96-107
Polynomial graph-colorings
Wolfgang Gutjahr, Emo Welzl, Gerhart Wöginger
Lecture Notes in Computer Science 349, 1989, pp. 108-119
Time-optimal simulations of networks by universal parallel computers
Friedhelm Meyer auf der Heide, Rolf Wanka
Lecture Notes in Computer Science 349, 1989, pp. 120-131
Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
Friedhelm Hinz
Lecture Notes in Computer Science 349, 1989, pp. 132-143
Linear numeration systems, \Theta-developments and finite automata
Christiane Frougny
Lecture Notes in Computer Science 349, 1989, pp. 144-155
A generalization of automatic sequences
Jeffrey Shallit
Lecture Notes in Computer Science 349, 1989, pp. 156-167
Word problems over traces which are solvable in linear time
Volker Diekert
Lecture Notes in Computer Science 349, 1989, pp. 168-180
Computing minimum spanning forests on 1- and 2- dimensional processor arrays
Friedhelm Meyer auf der Heide
Lecture Notes in Computer Science 349, 1989, pp. 181-192
Parallel computation of discrete Voronoi diagrams
Otfried Schwarzkopf
Lecture Notes in Computer Science 349, 1989, pp. 193-204
Successive approximation in parallel graph algorithms
Donald Fussell, Ramakrishna Thurimella
Lecture Notes in Computer Science 349, 1989, pp. 205-217
Reversals and Alternation
Gerhard Buntrock, Albrecht Höne
Lecture Notes in Computer Science 349, 1989, pp. 218-228
On the power of parity polynomial time
Jin-yi Cai, Lane A. Hemachandra
Lecture Notes in Computer Science 349, 1989, pp. 229-239
Complete problems and strong polynomial reducibilities
K. Ganesan, Steven Homer
Lecture Notes in Computer Science 349, 1989, pp. 240-250
If deterministic and nondeterministic space complexities are equal for \log\log n then they are also equal for \log n
Andrzej Szepietowski
Lecture Notes in Computer Science 349, 1989, pp. 251-255
On the complexity of approximating the independent set problem
Piotr Berman, Georg Schnitger
Lecture Notes in Computer Science 349, 1989, pp. 256-268
Average number of messages for distributed leader finding in rings of processors
Christian Lavault
Lecture Notes in Computer Science 349, 1989, pp. 269-281
Time vs. bits
Mark H. Overmars, Nicola Santoro
Lecture Notes in Computer Science 349, 1989, pp. 282-293
Distributed computing on transitive networks: The torus
Paul W. Beame, Hans L. Bodländer
Lecture Notes in Computer Science 349, 1989, pp. 294-303

Seiten 1 2 >