Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=583

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

Linear time algorithms for liveness and boundedness in conflict-free Petri nets
Paola Alimonti, Esteban Feuerstein, Umberto Nanni
Lecture Notes in Computer Science 583, 1992, pp. 1-14
q-regular sequences and other generalizations of q-automatic sequences
Jean-Paul Allouche
Lecture Notes in Computer Science 583, 1992, pp. 15-23
Complex polynomials and circuit lower bounds for modular counting
David A. Mix Barrington, Howard Straubing
Lecture Notes in Computer Science 583, 1992, pp. 24-31
A decidability result about convex polyominoes
Danièle Beauquier, Michel Latteux, Karine Slowinski
Lecture Notes in Computer Science 583, 1992, pp. 32-45
Edge insertion for optimal triangulations
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T.S. Tan
Lecture Notes in Computer Science 583, 1992, pp. 46-60
Simulating permutation networks on hypercubes
Said Bettayeb, Bin Cong, Mike Girou, I. Hal Sudborough
Lecture Notes in Computer Science 583, 1992, pp. 61-70
Universal statistical tests
Manuel Blum
Lecture Notes in Computer Science 583, 1992, pp. 71-75
Automata and pattern matching in planar directed acyclic graphs
F. Bossut, B. Warin
Lecture Notes in Computer Science 583, 1992, pp. 76-86
Regular expressions into finite automata
Anne Brüggemann-Klein
Lecture Notes in Computer Science 583, 1992, pp. 87-98
Automata and codes with bounded deciphering delay
Véronique Bruyère
Lecture Notes in Computer Science 583, 1992, pp. 99-107
Parallel complexity of heaps and min-max heaps
Svante Carlsson, Jingsen Chen
Lecture Notes in Computer Science 583, 1992, pp. 108-116
On the complexity of some problems for the Blum, Shub & Smale model
Felipe Cucker, Francesc Rosselló
Lecture Notes in Computer Science 583, 1992, pp. 117-129
Average case analysis of a greedy algorithm for the minimum hitting set problem
W. Fernandez de la Vega, V.Th. Paschos, R. Saad
Lecture Notes in Computer Science 583, 1992, pp. 130-138
Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
Afonso G. Ferreira, Siang W. Song
Lecture Notes in Computer Science 583, 1992, pp. 139-153
How to write integers in non-integer base
Christiane Frougny
Lecture Notes in Computer Science 583, 1992, pp. 154-164
A simple randomized parallel algorithm fo maximal f-matchings
Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
Lecture Notes in Computer Science 583, 1992, pp. 165-176
On the number of components of a recursive graph
William I. Gasarch, Katia S. Guimarães
Lecture Notes in Computer Science 583, 1992, pp. 177-190
Factoring in skew-polynomial rings
Mark Giesbrecht
Lecture Notes in Computer Science 583, 1992, pp. 191-203
Leaders election without conflict resolution rule-fast and efficient randomized simulations among CRCW PRAMs
Joseph Gil, Yossi Matias
Lecture Notes in Computer Science 583, 1992, pp. 204-218
Dynamics of sand-piles games on graphs
Eric Goles, Marcos A. Kiwi
Lecture Notes in Computer Science 583, 1992, pp. 219-230
Rational function decomposition and Gröbner bases in the parameterization of plane curves
Jaime Gutierrez, Tomas Recio
Lecture Notes in Computer Science 583, 1992, pp. 231-245
The double reconstruction conjectures about colored hypergraphs and colored directed graphs
Kosaburo Hashiguchi
Lecture Notes in Computer Science 583, 1992, pp. 246-261
Locally definable acceptance types-the three-valued case
Ulrich Hertrampf
Lecture Notes in Computer Science 583, 1992, pp. 262-271
On the computation of the Hilbert series
Joachim Hollman
Lecture Notes in Computer Science 583, 1992, pp. 272-280
A distributed algorithm for finding all maximal cliques in a network graph
Esther Jennings, Lenka Motyc̑ková
Lecture Notes in Computer Science 583, 1992, pp. 281-293

Seiten 1 2 >