Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Series=LNCS AND Volume=443
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Leda
Stefan Näher
,
Kurt Mehlhorn
Lecture Notes in Computer Science
443
, 1990, pp. 1-5
A new universal class of hash functions and dynamic hashing in real time
Martin Dietzfelbinger
,
Friedhelm Meyer auf der Heide
Lecture Notes in Computer Science
443
, 1990, pp. 6-19
A complete and decidable proof system for call-by-value equalities
Jon G. Riecke
Lecture Notes in Computer Science
443
, 1990, pp. 20-31
Static correctness of hierarchical procedures
Michael I. Schwartzbach
Lecture Notes in Computer Science
443
, 1990, pp. 32-45
Generic terms having no polymorphic types
Sophie Malecki
Lecture Notes in Computer Science
443
, 1990, pp. 46-59
A complete system of B-rational identities
Daniel Krob
Lecture Notes in Computer Science
443
, 1990, pp. 60-73
On non-counting regular classes
Aldo de Luca
,
Stefano Varricchio
Lecture Notes in Computer Science
443
, 1990, pp. 74-87
Two-way automata with multiplicities
M. Anselmo
Lecture Notes in Computer Science
443
, 1990, pp. 88-102
\omega
-continuous semirings, algebraic systems and pushdown automata
Werner Kuich
Lecture Notes in Computer Science
443
, 1990, pp. 103-110
Nondeterministic computations in sublogarithmic space and space constructibility
Viliam Geffert
Lecture Notes in Computer Science
443
, 1990, pp. 111-124
Normalizing and accelerating RAM computations and the problem of reasonable space measures
Juraj Wiedermann
Lecture Notes in Computer Science
443
, 1990, pp. 125-138
A formal study of learning via queries
Osamu Watanabe
Lecture Notes in Computer Science
443
, 1990, pp. 139-152
Language learning by a ``team''
Sanjay Jain
,
Arun Sharma
Lecture Notes in Computer Science
443
, 1990, pp. 153-166
Functions as processes
Robin Milner
Lecture Notes in Computer Science
443
, 1990, pp. 167-180
A domain-theoretic model for a higher-order process calculus
Radha Jagadeesan
,
Prakash Panangaden
Lecture Notes in Computer Science
443
, 1990, pp. 181-194
Concurrency, automata and domains
Manfred Droste
Lecture Notes in Computer Science
443
, 1990, pp. 195-208
A theory of communicating processes with value-passing
M. Hennessy
,
A. Ingôlfsdóttir
Lecture Notes in Computer Science
443
, 1990, pp. 209-219
Analytic variations on the common subexpresion problem
Philippe Flajolet
,
Paolo Sipala
,
Jean-Marc Steyaert
Lecture Notes in Computer Science
443
, 1990, pp. 220-234
On the distributional complexity of disjointness
A.A. Razborov
Lecture Notes in Computer Science
443
, 1990, pp. 249-253
Computing boolean functions oon anonymous networks
Evangelos Kranakis
,
Danny Krizanc
,
Jacob van den Berg
Lecture Notes in Computer Science
443
, 1990, pp. 254-267
On the composition of zero-knowledge proof systems
Oded Goldreich
,
Hugo Krawczyk
Lecture Notes in Computer Science
443
, 1990, pp. 268-282
Additional queries to random and pseudorandom oracles
Ronald V. Book
,
Jack H. Lutz
,
Shouwen Tang
Lecture Notes in Computer Science
443
, 1990, pp. 283-293
Communication among relations
A. Rabinovich
,
B.A. Trakhtenbrot
Lecture Notes in Computer Science
443
, 1990, pp. 294-307
Stability and sequentiality in dataflow networks
Prakash Panangaden
,
Vasant Shanbhogue
,
Eugene W. Stark
Lecture Notes in Computer Science
443
, 1990, pp. 308-321
Automata for modeling real-time systems
Rajeev Alur
,
David Dill
Lecture Notes in Computer Science
443
, 1990, pp. 322-335
Seiten 1
2
3
>