Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=372

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

Realizable and unrealizable specifications of reactive systems
M. Abadi, L. Lamport, P. Wolper
Lecture Notes in Computer Science 372, 1989, pp. 1-17
Limitations of the upward separation technique
E. Allender
Lecture Notes in Computer Science 372, 1989, pp. 18-30
Lower bounds for the low hierarchy
E. Allender, L.A. Hemachandra
Lecture Notes in Computer Science 372, 1989, pp. 31-45
Efficient text searching of regular expressions
R.A. Baeza-Yates, G.H. Gonnet
Lecture Notes in Computer Science 372, 1989, pp. 46-62
Factors of words
D. Beauquier, J.E. Pin
Lecture Notes in Computer Science 372, 1989, pp. 63-79
Asymptotically optimal distributed consensus
P. Berman, J.A. Garay
Lecture Notes in Computer Science 372, 1989, pp. 80-94
Time lower bounds for CREW-PRAM computation of monotone functions
G. Bilardi, A. Moitra
Lecture Notes in Computer Science 372, 1989, pp. 95-108
Subduing self-application
C. Böhm
Lecture Notes in Computer Science 372, 1989, pp. 108-122
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
G. Brassard, C. Crépeau, M. Yung
Lecture Notes in Computer Science 372, 1989, pp. 123-136
Polymorphic rewriting conserves algebraic strong normalization and confluence
V. Breazu-Tannen, J. Gallier
Lecture Notes in Computer Science 372, 1989, pp. 137-150
Completion of finite codes with finite deciphering delay
V. Bruyere
Lecture Notes in Computer Science 372, 1989, pp. 151-163
Relational semantics for recursive types and bounded quantification
F. Cardone
Lecture Notes in Computer Science 372, 1989, pp. 164-178
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
B. Chazelle, H. Edelsbrunner, L.J. Guibas, M. Sharir
Lecture Notes in Computer Science 372, 1989, pp. 179-193
About primitive recursive algorithms
L. Colson
Lecture Notes in Computer Science 372, 1989, pp. 194-206
The definability of equational graphs in monadic second-order logic
B. Courcelle
Lecture Notes in Computer Science 372, 1989, pp. 207-221
Dominoes and the regularity of DNA splicing languages
K. Culik II, T. Harju
Lecture Notes in Computer Science 372, 1989, pp. 222-233
Causal trees
P. Darondeau, P. Degano
Lecture Notes in Computer Science 372, 1989, pp. 234-248
Infinite normal forms
N. Dershowitz, S. Kaplan, D.A. Plaisted
Lecture Notes in Computer Science 372, 1989, pp. 249-262
On recent trends in algebraic specification
H. Ehrig, P. Pepper, F. Orejas
Lecture Notes in Computer Science 372, 1989, pp. 263-288
Automata with storage on infinite words
J. Engelfriet, H.J. Hoogeboom
Lecture Notes in Computer Science 372, 1989, pp. 289-303
Parallel algorithmic techniques for combinatorial computation
D. Eppstein, Z. Galil
Lecture Notes in Computer Science 372, 1989, pp. 304-318
On dice and coins: Models of computation for random generation
D. Feldman, R. Impagliazzo, M. Naor, N. Nisan, S. Rudich, A. Shamir
Lecture Notes in Computer Science 372, 1989, pp. 319-340
An optimal probabilistic algorithm for synchronous Byzantine agreement
P. Feldman, S. Micali
Lecture Notes in Computer Science 372, 1989, pp. 341-378
Finding triconnected components by local replacements
D. Fussel, V. Ramachandran, R. Thurimella
Lecture Notes in Computer Science 372, 1989, pp. 379-393
An improved algorithm for approximate string matching
Z. Galil, K. Park
Lecture Notes in Computer Science 372, 1989, pp. 394-404

Seiten 1 2 3 >