Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=115

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

Refined analysis and improvements on some factoring algorithms
C.P. Schnorr
Lecture Notes in Computer Science 115, 1981, pp. 1-15
Absolute primality of polynomials is decidable in random polynomial time in the number of the variables
J. Heintz, M. Sieveking
Lecture Notes in Computer Science 115, 1981, pp. 16-28
Area-time optimal VLSI networks for computing integer multiplication and Discrete Fourier Transform
F.P. Preparata, J.E. Vuillemin
Lecture Notes in Computer Science 115, 1981, pp. 29-40
Cost tradeoffs in graph embeddings, with applications
Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg
Lecture Notes in Computer Science 115, 1981, pp. 41-55
Minimum s-t cut of a planar undirected network in O(n \log^2 (n)) time
John H. Reif
Lecture Notes in Computer Science 115, 1981, pp. 56-67
On the density of color-families
E. Welzl
Lecture Notes in Computer Science 115, 1981, pp. 68-72
The implication problem for data dependencies
C. Beeri, M.Y. Vardi
Lecture Notes in Computer Science 115, 1981, pp. 73-85
Characterizing data base dependencies
J.A. Makowsky
Lecture Notes in Computer Science 115, 1981, pp. 86-97
Data flow analysis of applicative programs
Micha Sharir
Lecture Notes in Computer Science 115, 1981, pp. 98-113
Flow analysis of lambda expressions
Neil D. Jones
Lecture Notes in Computer Science 115, 1981, pp. 114-128
Algorithmic specifications of abstract data types
Jacques Loeckx
Lecture Notes in Computer Science 115, 1981, pp. 129-147
Nondeterminism in abstract data types
P.A. Subrahmanyam
Lecture Notes in Computer Science 115, 1981, pp. 148-164
A view of directions in relational database theory
Jeffrey D. Ullman
Lecture Notes in Computer Science 115, 1981, pp. 165-176
A new characterization of the regular languages
Christoph Reutenauer
Lecture Notes in Computer Science 115, 1981, pp. 177-183
Langages reconnaissables et codage prefixe pur
Jean Eric Pin
Lecture Notes in Computer Science 115, 1981, pp. 184-192
Passes, sweeps and visits
Joost Engelfriet, Gilberto Filè
Lecture Notes in Computer Science 115, 1981, pp. 193-207
On LALRk testing
Seppo Sippu, Eljas Soisalon-Soininen
Lecture Notes in Computer Science 115, 1981, pp. 208-217
On size bounds for deterministic parsers
Esko Ukkonen
Lecture Notes in Computer Science 115, 1981, pp. 218-228
A decision procedure for one equivalence of two dpdas - One of which is linear
Yair Itzhaik, Amiram Yehudai
Lecture Notes in Computer Science 115, 1981, pp. 229-237
The deducibility problem in propositional dynamic logic
Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska
Lecture Notes in Computer Science 115, 1981, pp. 238-248
Finite models for deterministic propositional dynamic logic
Mordechai Ben-Ari, Joseph Y. Halpern, Amir Pnueli
Lecture Notes in Computer Science 115, 1981, pp. 249-263
Impartiality, justice and fairness: The ethics of concurrent termination
D. Lehmann, A. Pnueli, J. Stavi
Lecture Notes in Computer Science 115, 1981, pp. 264-277
Computing a perfect strategy for n \times n chess requires time exponential in n
Aviezri S. Fraenkel, David Lichtenstein
Lecture Notes in Computer Science 115, 1981, pp. 278-293
On the complexity of simple arithmetic expressions
Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran
Lecture Notes in Computer Science 115, 1981, pp. 294-304
Proving lower bounds for linear decision trees
Marc Snir
Lecture Notes in Computer Science 115, 1981, pp. 305-315

Seiten 1 2 >