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: Journal=Algorithmica AND YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A near-linear area bound for drawing binary trees
T.M. Chan
Algorithmica
34
(1), 2002, pp. 1-13
Pinwheel scheduling: Achievable densities
P.C. Fishburn
,
J.C. Lagarias
Algorithmica
34
(1), 2002, pp. 14-38
Splitting a Delaunay triangulation in linear time
B. Chazelle
,
O. Devillers
,
F. Hurtado
,
M. Mora
,
V. Sacristán
,
M. Teillaud
Algorithmica
34
(1), 2002, pp. 39-46
The analysis of evolutionary algorithms - A proof that crossover really can help
T. Jansen
,
I. Wegener
Algorithmica
34
(1), 2002, pp. 47-66
Testing and spot-checking of data streams
J. Feigenbaum
,
S. Kannan
,
M. Strauss
,
M. Viswanathan
Algorithmica
34
(1), 2002, pp. 67-80
Realistic input models for geometric algorithms
Mark de Berg
,
Matthew J. Katz
,
A. Frank van der Stappen
,
Jules Vleugels
Algorithmica
34
(1), 2002, pp. 81-97
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
J.-D. Boissonnat
,
S.K. Ghosh
,
T. Kavitha
,
S. Lazard
Algorithmica
34
(2), 2002, pp. 109-156
Further thoughts on the syntenic distance between genomes
Nadia Pisanti
,
Marie-France Sagot
Algorithmica
34
(2), 2002, pp. 157-180
Fair versus unrestricted bin packing
Yossi Azar
,
Joan Boyar
,
Leah Epstein
,
Lene M. Favrholdt
,
Kim S. Larsen
,
Morten N. Nielsen
Algorithmica
34
(2), 2002, pp. 181-196
Approximation algorithms for access network design
Matthew Andrews
,
Lisa Zhang
Algorithmica
34
(2), 2002, pp. 197-215
Partitioning a square into rectangles:
NP
-completeness and approximation algorithms
Olivier Beaumont
,
Vincent Boudet
,
Fabrice Rastello
,
Yves Robert
Algorithmica
34
(3), 2002, pp. 217-239
Max- and min-neighborhood monopolies
Kazuhisa Makino
,
Masafumi Yamashita
,
Tiko Kameda
Algorithmica
34
(3), 2002, pp. 240-260
Budget management with applications
Chunhong Chen
,
Elaheh Bozorgzadeh
,
Ankur Srivastava
,
Majid Sarrafzadeh
Algorithmica
34
(3), 2002, pp. 261-275
Communication-processor tradeoffs in a limited resources PRAM
Adnan Agbaria
,
Yosi Ben-Asher
,
Ilan Newman
Algorithmica
34
(3), 2002, pp. 276-297
Planar graph blocking for external searching
Surender Baswana
,
Sandeep Sen
Algorithmica
34
(3), 2002, pp. 298-308
Introduction
Michele Mosca
,
Alain Tapp
Algorithmica
34
(4), 2002, pp. 309-313
Secrecy, computational loads and rates in practical quantum cryptography
Gerald Gilbert
,
Michael Hamrick
Algorithmica
34
(4), 2002, pp. 314-339
Security of practical time-reversed EPR quantum key distribution
Hitoshi Inamori
Algorithmica
34
(4), 2002, pp. 340-365
Security of practical BB84 quantum key distribution
Hitoshi Inamori
Algorithmica
34
(4), 2002, pp. 366-371
Security of quantum key distribution against all collective attacks
Eli Biham
,
Michel Boyer
,
Gilles Brassard
,
Jeroen van de Graaf
,
Tal Mor
Algorithmica
34
(4), 2002, pp. 372-388
Linking classical and quantum key agreement: Is there a classical analog to bound entanglement?
Nicolas Gisin
,
Renato Renner
,
Stefan Wolf
Algorithmica
34
(4), 2002, pp. 389-412
Quantum algorithms for weighing matrices and quadratic residues
Wim van Dam
Algorithmica
34
(4), 2002, pp. 413-428
Quantum complexities of ordered searching, sorting, and element distinctness
Peter Hyer
,
Jan Neerbek
,
Yaoyun Shi
Algorithmica
34
(4), 2002, pp. 429-448
Sharp quantum versus classical query complexity separations
J. Niel de Beaudrap
,
Richard Cleve
,
John Watrous
Algorithmica
34
(4), 2002, pp. 449-461
The quantum complexity of set membership
Jaikumar Radhakrishnan
,
Pranab Sen
,
S. Venkatesh
Algorithmica
34
(4), 2002, pp. 462-479
Seiten 1
2
3
4
>