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 YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing a lower bound for the canonical height on elliptic curves over
\mathbb {Q}
John Cremona
,
Samir Siksek
Lecture Notes in Computer Science
4076
, 2006, pp. 275-286
Arithmetic of generalized Jacobians
Isabelle Déchène
Lecture Notes in Computer Science
4076
, 2006, pp. 421-435
Hidden pairings and trapdoor DDH groups
Alexander W. Dent
,
Steven D. Galbraith
Lecture Notes in Computer Science
4076
, 2006, pp. 436-451
An index calculus algorithm for plane curves of small degree
Claus Diem
Lecture Notes in Computer Science
4076
, 2006, pp. 543-557
Multiplexing packets with arbitrary deadlines in bounded buffers
Yossi Azar
,
Nir Levy
Lecture Notes in Computer Science
4059
, 2006, pp. 5-16
Scheduling jobs on grid processors
Joan Boyar
,
Lene M. Favrholdt
Lecture Notes in Computer Science
4059
, 2006, pp. 17-28
An
O(n^{2.75})
algorithm for online topological ordering
Deepak Ajwani
,
Tobias Friedrich
,
Ulrich Meyer
Lecture Notes in Computer Science
4059
, 2006, pp. 53-64
Dynamic matching markets and voting paths
David J. Abraham
,
Telikepalli Kavitha
Lecture Notes in Computer Science
4059
, 2006, pp. 65-76
Unbiased matrix rounding
Benjamin Doerr
,
Tobias Friedrich
,
Christian Klein
,
Ralf Osbild
Lecture Notes in Computer Science
4059
, 2006, pp. 102-112
Fast subexponential algorithm for non-local problems on graphs of bounded genus
Frederic Dorn
,
Fedor V. Fomin
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
4059
, 2006, pp. 172-183
On the approximation hardness of some generalizations of TSP
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Joachim Kneis
,
Joachim Kupke
Lecture Notes in Computer Science
4059
, 2006, pp. 184-195
Reoptimization of minimum and maximum Traveling Salesman's tours
Giorgio Ausiello
,
Bruno Escoffier
,
Jérôme Monnot
,
Vangelis Th. Paschos
Lecture Notes in Computer Science
4059
, 2006, pp. 196-207
The node-weighted Steiner problem in graphs of restricted node weights
Spyros Angelopoulos
Lecture Notes in Computer Science
4059
, 2006, pp. 208-219
Acyclic orientation of drawings
Eyal Ackerman
,
Kevin Buchin
,
Christian Knauer
,
Günter Rote
Lecture Notes in Computer Science
4059
, 2006, pp. 268-279
Improved algorithms for quantum identification of Boolean oracles
Andris Ambainis
,
Kazuo Iwama
,
Akinori Kawachi
,
Rudy Raymond
,
Shigeru Yamashita
Lecture Notes in Computer Science
4059
, 2006, pp. 280-291
Approximability of minimum AND-circuits
Jan Arpe
,
Bodo Manthey
Lecture Notes in Computer Science
4059
, 2006, pp. 292-303
An approximation algorithm for the wireless gathering problem
Vincenzo Bonifaci
,
Peter Korteweg
,
Alberto Marchetti-Spaccamela
,
Leen Stougie
Lecture Notes in Computer Science
4059
, 2006, pp. 328-338
Minimum membership set covering and the consecutive ones property
Michael Dom
,
Jiong Guo
,
Rolf Niedermeier
,
Sebastian Wernicke
Lecture Notes in Computer Science
4059
, 2006, pp. 339-350
Approximating rational objectives is as easy as approximating linear ones
José R. Correa
,
Cristina G. Fernandes
,
Yoshiko Wakabayashi
Lecture Notes in Computer Science
4059
, 2006, pp. 351-362
In-place algorithms for computing (layers of) maxima
Henrik Blunck
,
Jan Vahrenhold
Lecture Notes in Computer Science
4059
, 2006, pp. 363-374
The weighted maximum-mean subtree and other bicriterion subtree problems
Josiah Carlson
,
David Eppstein
Lecture Notes in Computer Science
4059
, 2006, pp. 400-410
Linear-time algorithms for tree root problems
Maw-Shang Chang
,
Ming-Tat Ko
,
Hsueh-I Lu
Lecture Notes in Computer Science
4059
, 2006, pp. 411-422
Generalized powers of graphs and their algorithmic use
Andreas Brandstädt
,
Feodor F. Dragan
,
Yang Xiang
,
Chenyu Yan
Lecture Notes in Computer Science
4059
, 2006, pp. 423-434
The one way to quantum computation
Vincent Danos
,
Elham Kashefi
,
Prakash Panangaden
Lecture Notes in Computer Science
4052
, 2006, pp. 13-21
Cryptographically sound implementations for communicating processes
Pedro Adão
,
Cédric Fournet
Lecture Notes in Computer Science
4052
, 2006, pp. 83-94
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>