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
[2]
Hilfe
Suche: Series=LNCS AND Volume=1644
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient merging, construction, and maintenance of evolutionary trees
Andrzej Lingas
,
Hans Olsson
,
Anna Östlin
Lecture Notes in Computer Science
1644
, 1999, pp. 544-553
Formalizing a lazy substitution proof system for
\mu
-calculus in the calculus of inductive constructions
Marino Miculan
Lecture Notes in Computer Science
1644
, 1999, pp. 554-564
Leader election by
d
dimensional cellular automata
Codrin Nichitiu
,
Eric Rémila
Lecture Notes in Computer Science
1644
, 1999, pp. 565-574
New upper bounds for MaxSat
Rolf Niedermeier
,
Peter Rossmanith
Lecture Notes in Computer Science
1644
, 1999, pp. 575-584
Polynomial and rational evaluation and interpolation (with structured matrices)
Vadim Olshevsky
,
Victor Y. Pan
Lecture Notes in Computer Science
1644
, 1999, pp. 585-594
Low redundancy in static dictionaries with
O(1)
worst case lookup time
Rasmus Pagh
Lecture Notes in Computer Science
1644
, 1999, pp. 595-604
Finite automata with generalized acceptance criteria
Timo Peichl
,
Heribert Vollmer
Lecture Notes in Computer Science
1644
, 1999, pp. 605-614
A variant of the arrow distributed directory with low average complexity
David Peleg
,
Eilon Reshef
Lecture Notes in Computer Science
1644
, 1999, pp. 615-624
Closed Freyd- and
\kappa
-categories
John Power
,
Hayo Thielecke
Lecture Notes in Computer Science
1644
, 1999, pp. 625-634
Typed exceptions and continuations cannot macro-express each other
Jon G. Riecke
,
Hayo Thielecke
Lecture Notes in Computer Science
1644
, 1999, pp. 635-644
Automata, power series, and coinduction: Taking input derivatives seriously
J.J.M.M. Rutten
Lecture Notes in Computer Science
1644
, 1999, pp. 645-654
Accessing multiple sequences through set associative caches
Peter Sanders
Lecture Notes in Computer Science
1644
, 1999, pp. 655-664
T(A = T(B)?
Gérard Sénizergues
Lecture Notes in Computer Science
1644
, 1999, pp. 665-675
Many-valued logics and holographic proofs
Mario Szegedy
Lecture Notes in Computer Science
1644
, 1999, pp. 676-686
On the complexity and inapproximability of shortest implicant problems
Christopher Umans
Lecture Notes in Computer Science
1644
, 1999, pp. 687-696
The wave propagator is Turing computable
Klaus Weihrauch
,
Ning Zhong
Lecture Notes in Computer Science
1644
, 1999, pp. 697-706
An FPTAS for agreeably weighted variance on a single machine
Gerhard J. Woeginger
Lecture Notes in Computer Science
1644
, 1999, pp. 707-716
Seiten
<
1
2
3