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
[1]
Hilfe
Suche: Series=LNCS AND Volume=1113
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On unconditional transfer
Henning Fernau
Lecture Notes in Computer Science
1113
, 1996, pp. 348-359
(poly(\log\log n)
,
poly(\log\log n))
-restricted verifiers are unlikely to exist for languages in
NP
Dimitris Fotakis
,
Paul Spirakis
Lecture Notes in Computer Science
1113
, 1996, pp. 360-371
Minimizing congestion of layouts for ATM networks with faulty links
Leszek Ga̧sieniec
,
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
Lecture Notes in Computer Science
1113
, 1996, pp. 372-381
Polynomial automaticity, context-free languages, and fixed points of morphisms
Ian Glaister
,
Jeffrey Shallit
Lecture Notes in Computer Science
1113
, 1996, pp. 382-393
Causal testing
Ursula Goltz
,
Heike Wehrheim
Lecture Notes in Computer Science
1113
, 1996, pp. 394-406
Construction of list homomorphisms by tupling and fusion
Zhenjiang Hu
,
Hideya Iwasaki
,
Masato Takeichi
Lecture Notes in Computer Science
1113
, 1996, pp. 407-418
Probabilistic metric semantics for a simple language with recursion
Marta Kwiatkowska
,
Gethin Norman
Lecture Notes in Computer Science
1113
, 1996, pp. 419-430
Dynamic graphs
Andrea Maggiolo-Schettini
,
Józef Winkowski
Lecture Notes in Computer Science
1113
, 1996, pp. 431-442
Equations on trees
Sabrina Mantaci
,
Antonio Restivo
Lecture Notes in Computer Science
1113
, 1996, pp. 443-456
On the equivalence problem for
E
-pattern languages
Enno Ohlebusch
,
Esko Ukkonen
Lecture Notes in Computer Science
1113
, 1996, pp. 457-468
Specifying and verifying parametric processes
Wiesƚaw Pawƚowski
,
Paweƚ Pa̧czkowski
,
Stefan Sokoƚowski
Lecture Notes in Computer Science
1113
, 1996, pp. 469-481
On saturation with flexible function symbols
Regimantas Plius̑kevic̑ius
Lecture Notes in Computer Science
1113
, 1996, pp. 482-493
Approximating good simultaneous diophantine approximations is almost
NP
-hard
Carsten Rössner
,
Jean-Pierre Seifert
Lecture Notes in Computer Science
1113
, 1996, pp. 494-505
On the conjugation of standard morphisms
Patrice Séébold
Lecture Notes in Computer Science
1113
, 1996, pp. 506-516
A semantic matching algorithm: Analysis and implementation
Hui Shi
Lecture Notes in Computer Science
1113
, 1996, pp. 517-528
Routing on triangles, tori and honeycombs
Jop F. Sibeyn
Lecture Notes in Computer Science
1113
, 1996, pp. 529-541
A uniform analysis of trie structures that store prefixing-keys with application to doubly-chained prefixing-tries
Pilar de la Torre
,
David T. Kao
Lecture Notes in Computer Science
1113
, 1996, pp. 542-553
On fairness in terminating and reactive programs
Axel Wabenhorst
Lecture Notes in Computer Science
1113
, 1996, pp. 554-565
Polynomial time samplable distributions
Tomoyuki Yamakami
Lecture Notes in Computer Science
1113
, 1996, pp. 566-578
From static to dynamic abstract data-types
Elena Zucca
Lecture Notes in Computer Science
1113
, 1996, pp. 579-590
Seiten
<
1
2