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=2653
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nearly bounded error probabilistic sets
Tomoyuki Yamakami
Lecture Notes in Computer Science
2653
, 2003, pp. 213-226
Some properties of MOD
_m
circuits computing simple functions
Kazuyuki Amano
,
Akira Maruoka
Lecture Notes in Computer Science
2653
, 2003, pp. 227-237
XOR-based schemes for fast parallel IP lookups
Giancarlo Bongiovanni
,
Paolo Penna
Lecture Notes in Computer Science
2653
, 2003, pp. 238-250
The impact of network structure on the stability of greedy protocols
Dmitrios Koukopoulos
,
Marios Mavronicolas
,
Sotiris Nikoletseas
,
Paul Spirakis
Lecture Notes in Computer Science
2653
, 2003, pp. 251-263
Improving customer proximity to railway stations
Evangelos Kranakis
,
Paolo Penna
,
Konrad Schlude
,
David Scot Taylor
,
Peter Widmayer
Lecture Notes in Computer Science
2653
, 2003, pp. 264-276
Differential approximation for some routing problems
Cristina Bazgan
,
Refael Hassin
,
Jérôme Monnot
Lecture Notes in Computer Science
2653
, 2003, pp. 277-288
Seiten
<
1
2