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 YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deciding relaxed two-colorability - A hardness jump
Robert Berke
,
Tibor Szabó
Lecture Notes in Computer Science
4168
, 2006, pp. 124-135
Negative examples for sequential importance sampling of binary contingency tables
Ivona Bezáková
,
Alistair Sinclair
,
Daniel S̑tefankovic̑
,
Eric Vigoda
Lecture Notes in Computer Science
4168
, 2006, pp. 136-147
Estimating entropy over data streams
Lakshminath Bhuvanagiri
,
Sumit Ganguly
Lecture Notes in Computer Science
4168
, 2006, pp. 148-159
Necklaces, convolutions, and X + Y
David Bremner
,
Timothy M. Chan
,
Erik D. Demaine
,
Jeff Erickson
,
Ferran Hurtado
,
John Iacono
,
Stefan Langerman
,
Perouz Taslakian
Lecture Notes in Computer Science
4168
, 2006, pp. 160-171
Purely functional worst case constant time catenable sorted lists
Gerth Stlting Brodal
,
Christos Makris
,
Kostas Tsichlas
Lecture Notes in Computer Science
4168
, 2006, pp. 172-183
Taxes for linear atomic congestion games
Ioannis Caragiannis
,
Christos Kaklamanis
,
Panagiotis Kanellopoulos
Lecture Notes in Computer Science
4168
, 2006, pp. 184-195
Spanners with slack
T.-H. Hubert Chan
,
Michael Dinitz
,
Anupam Gupta
Lecture Notes in Computer Science
4168
, 2006, pp. 196-207
Compressed indexes for approximate string matching
Ho-Leung Chan
,
Tak-Wah Lam
,
Wing-Kin Sung
,
Siu-Lung Tam
,
Swee-Seong Wong
Lecture Notes in Computer Science
4168
, 2006, pp. 208-219
Traversing the machining graph
Danny Z. Chen
,
Rudolf Fleischer
,
Jian Li
,
Haitao Wang
,
Hong Zhu
Lecture Notes in Computer Science
4168
, 2006, pp. 220-231
Efficient computation of Nash equilibria for very sparse win-lose bimatrix games
Bruno Codenotti
,
Mauro Leoncini
,
Giovanni Resta
Lecture Notes in Computer Science
4168
, 2006, pp. 232-243
Distributed almost exact approximations for minor-closed families
Andrzej Czygrinow
,
Michaƚ Hańćkowiak
Lecture Notes in Computer Science
4168
, 2006, pp. 244-255
Spectral clustering by recursive partitioning
Anirban Dasgupta
,
John Hopcroft
,
Ravi Kannan
,
Pradipta Mitra
Lecture Notes in Computer Science
4168
, 2006, pp. 256-267
Finite termination of ''augmenting path'' algorithms in the presence of irrational problem data
Brian C. Dean
,
Michel X. Goemans
,
Nicole Immorlica
Lecture Notes in Computer Science
4168
, 2006, pp. 268-279
Dynamic programming and fast matrix multiplication
Frederic Dorn
Lecture Notes in Computer Science
4168
, 2006, pp. 280-291
Near-entropy hotlink assignments
Karim Douïeb
,
Stefan Langerman
Lecture Notes in Computer Science
4168
, 2006, pp. 292-303
Subspace sampling and relative-error matrix approximation: Column-row-based methods
Petros Drineas
,
Michael W. Mahoney
,
S. Muthukrishnan
Lecture Notes in Computer Science
4168
, 2006, pp. 304-314
Out-of-order event processing in kinetic data structures
Mohammad Ali Abam
,
Pankaj K. Agarwal
,
Mark de Berg
,
Hai Yu
Lecture Notes in Computer Science
4168
, 2006, pp. 624-635
Kinetic algorithms via self-adjusting computation
Umut A. Acar
,
Guy E. Blelloch
,
Kanat Tangwongsan
,
Jorge L. Vittes
Lecture Notes in Computer Science
4168
, 2006, pp. 636-647
Reporting flock patterns
Marc Benkert
,
Joachim Gudmundsson
,
Florian Hübner
,
Thomas Wolle
Lecture Notes in Computer Science
4168
, 2006, pp. 660-671
On exact algorithms for treewidth
Hans L. Bodlaender
,
Fedor V. Fomin
,
Arie M.C.A. Koster
,
Dieter Kratsch
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
4168
, 2006, pp. 672-683
An improved construction for counting Bloom filters
Flavio Bonomi
,
Michael Mitzenmacher
,
Rina Panigrahy
,
Sushil Singh
,
George Varghese
Lecture Notes in Computer Science
4168
, 2006, pp. 684-695
An MINLP solution method for a water network problem
Cristiana Bragalli
,
Claudia D'Ambrosio
,
Jon Lee
,
Andrea Lodi
,
Paolo Toth
Lecture Notes in Computer Science
4168
, 2006, pp. 696-707
Skewed binary search trees
Gerth Stlting Brodal
,
Gabriel Moruz
Lecture Notes in Computer Science
4168
, 2006, pp. 708-719
Algorithmic aspects of proportional symbol maps
S. Cabello
,
H. Haverkort
,
M. van Kreveld
,
B. Speckmann
Lecture Notes in Computer Science
4168
, 2006, pp. 720-731
Does path cleaning help in dynamic all-pairs shortest paths?
C. Demetrescu
,
P. Faruolo
,
G.F. Italiano
,
M. Thorup
Lecture Notes in Computer Science
4168
, 2006, pp. 732-743
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>