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=900
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A packet routing protocol for arbitrary networks
Friedhelm Meyer auf der Heide
,
Berthold Vöcking
Lecture Notes in Computer Science
900
, 1995, pp. 291-302
A family of tag systems for paperfolding sequences
Christiane Bercoff
Lecture Notes in Computer Science
900
, 1995, pp. 303-312
Growing context-sensitive languages and Church-Rosser languages
Gerhard Buntrock
,
Friedrich Otto
Lecture Notes in Computer Science
900
, 1995, pp. 313-324
Deterministic generalized automata
Dora Giammarresi
,
Rosa Montalbano
Lecture Notes in Computer Science
900
, 1995, pp. 325-336
Optimal simulation of automata by neural nets
P. Indyk
Lecture Notes in Computer Science
900
, 1995, pp. 337-348
Optimal lower bounds on the multiparty communication complexity
Pavol Dúris̑
,
José D.P. Rolim
Lecture Notes in Computer Science
900
, 1995, pp. 350-360
Simultaneous messages vs.\ communication
László Babai
,
Peter G. Kimmel
,
Satyanarayana V. Lokam
Lecture Notes in Computer Science
900
, 1995, pp. 361-372
Coding and strong coding in trace monoids
Véronique Bruyère
,
Clelia De Felice
Lecture Notes in Computer Science
900
, 1995, pp. 373-384
On codings of traces
Volker Diekert
,
Anca Muscholl
,
Klaus Reinhardt
Lecture Notes in Computer Science
900
, 1995, pp. 385-396
Finding largest common embeddable subtrees
Arvind Gupta
,
Naomi Nishimura
Lecture Notes in Computer Science
900
, 1995, pp. 397-408
The
\chi_t
-coloring problem
Damon Kaller
,
Arvind Gupta
,
Tom Shermer
Lecture Notes in Computer Science
900
, 1995, pp. 409-420
Expander properties in random regular graphs with edge faults
Sotiris E. Nikoletseas
,
Paul G. Spirakis
Lecture Notes in Computer Science
900
, 1995, pp. 421-432
Dynamic analysis of the sizes of relations
Danièle Gardy
,
Guy Louchard
Lecture Notes in Computer Science
900
, 1995, pp. 433-444
On slender context-free languages
Danny Raz
Lecture Notes in Computer Science
900
, 1995, pp. 445-454
Partial derivates of regular expressions and finite automata constructions
Valentin Antimirov
Lecture Notes in Computer Science
900
, 1995, pp. 455-466
Dependence orders for computations of concurrent automata
Felipe Bracho
,
Manfred Droste
,
Dietrich Kuske
Lecture Notes in Computer Science
900
, 1995, pp. 467-478
On the undecidability of deadlock detection in families of nets
Anne-Cécile Fabret
,
Antoine Petit
Lecture Notes in Computer Science
900
, 1995, pp. 479-490
On the average running time of odd-even merge sort
Christine Rüb
Lecture Notes in Computer Science
900
, 1995, pp. 491-502
Optimal average case sorting on arrays
Manfred Kunde
,
Rolf Niedermeier
,
Klaus Reinhardt
,
Peter Rossmanith
Lecture Notes in Computer Science
900
, 1995, pp. 503-514
Normal numbers and sources for BPP
Martin Strauss
Lecture Notes in Computer Science
900
, 1995, pp. 515-526
Lower bounds on learning decision lists and trees
Thomas Hancock
,
Tao Jiang
,
Ming Li
,
John Tromp
Lecture Notes in Computer Science
900
, 1995, pp. 527-538
Line segmentation of digital curves in parallel
Peter Damaschke
Lecture Notes in Computer Science
900
, 1995, pp. 539-549
Computability of convex sets
Martin Kummer
,
Marcus Schäfer
Lecture Notes in Computer Science
900
, 1995, pp. 550-561
Enumerating extreme points in higher dimensions
Th. Ottmann
,
S. Schuierer
,
S. Soundaralakshmi
Lecture Notes in Computer Science
900
, 1995, pp. 562-570
The number of views of piecewise-smooth algebraic objects
Sylvain Petitjean
Lecture Notes in Computer Science
900
, 1995, pp. 571-582
Seiten
<
1
2
3
>