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 YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Randomised algorithms for finding small weakly-connected dominating sets of regular graphs
William Duckworth
,
Bernard Mans
Lecture Notes in Computer Science
2653
, 2003, pp. 83-95
Additive spanners for
k
-chordal graphs
Victor D. Chepoi
,
Feodor F. Dragan
,
Chenyu Yan
Lecture Notes in Computer Science
2653
, 2003, pp. 96-107
Reconciling gene trees to a species tree
Paola Bonizzoni
,
Gianluca Della Vedova
,
Riccardo Dondi
Lecture Notes in Computer Science
2653
, 2003, pp. 120-131
Indexing structures for approximate string matching
Alessandra Gabriele
,
Fillippo Mignosi
,
Antonio Restivo
,
Marinella Sciortino
Lecture Notes in Computer Science
2653
, 2003, pp. 140-151
Approximation hardness for small occurrence instances
NP
-hard problems
Miroslav Chlebík
,
Janka Chlebíková
Lecture Notes in Computer Science
2653
, 2003, pp. 152-164
Fast approximation of minimum multicast congestion - Implementation versus theory
Andreas Baltz
,
Anand Srivastav
Lecture Notes in Computer Science
2653
, 2003, pp. 165-177
Approximation of a retrieval problem for parallel disks
Joep Aerts
,
Jan Korst
,
Frits Spieksma
Lecture Notes in Computer Science
2653
, 2003, pp. 178-188
On
k
-edge-connectivity problems with sharpened triangle inequality
Hans-Joachim Böckenhauer
,
Dirk Bongartz
,
Juraj Hromkovic̑
,
Ralf Klasing
,
Guido Proietti
,
Sebastian Seibert
,
Walter Unger
Lecture Notes in Computer Science
2653
, 2003, pp. 189-200
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
Differential approximation for some routing problems
Cristina Bazgan
,
Refael Hassin
,
Jérôme Monnot
Lecture Notes in Computer Science
2653
, 2003, pp. 277-288
Three constructions of authentication/secrecy codes
Cunsheng Ding
,
Arto Salomaa
,
Patrick Solé
,
Xiaojian Tian
Lecture Notes in Computer Science
2643
, 2003, pp. 24-33
The Jacobi model of an elliptic curve and side-channel analysis
Olivier Billet
,
Marc Joye
Lecture Notes in Computer Science
2643
, 2003, pp. 34-42
Fast point multiplication on elliptic curves through isogenies
Eric Brier
,
Marc Joye
Lecture Notes in Computer Science
2643
, 2003, pp. 43-50
Copyright control and separating systems
Sylvia Encheva
,
Gérard Cohen
Lecture Notes in Computer Science
2643
, 2003, pp. 79-86
A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols
Ivana Djurdjevic
,
Jun Xu
,
Khaled Abdel-Ghaffar
,
Shu Lin
Lecture Notes in Computer Science
2643
, 2003, pp. 98-107
Error correcting codes over algebraic surfaces
Thanasis Bouganis
Lecture Notes in Computer Science
2643
, 2003, pp. 169-179
A geometric view of decoding AG codes
Thanasis Bouganis
,
Drue Coles
Lecture Notes in Computer Science
2643
, 2003, pp. 180-190
Performance analysis of M-PSK signal constellations in Riemannian varieties
Rodrigo Gusmão Cavalcante
,
Reginaldo, Jr. Palazzo
Lecture Notes in Computer Science
2643
, 2003, pp. 191-203
Improvements to evaluation codes and new characterizations of Arf semigroups
Maria Bras-Amorós
Lecture Notes in Computer Science
2643
, 2003, pp. 204-215
Fast decomposition of polynomials with known Galois group
Andreas Enge
,
François Morain
Lecture Notes in Computer Science
2643
, 2003, pp. 254-264
External memory computational geometry revisited
Christian Breimann
,
Jan Vahrenhold
Lecture Notes in Computer Science
2625
, 2003, pp. 110-148
Memory limitations in artificial intelligence
Stefan Edelkamp
Lecture Notes in Computer Science
2625
, 2003, pp. 233-250
Hierarchical models and software tools for parallel programming
Massimo Coppola
,
Martin Schmollinger
Lecture Notes in Computer Science
2625
, 2003, pp. 320-354
Approximating geometric bottleneck shortest paths
Prosenjit Bose
,
Anil Maheshwari
,
Giri Narasimhan
,
Michiel Smid
,
Norbert Zeh
Lecture Notes in Computer Science
2607
, 2003, pp. 38-49
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>