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: Author="Iacono, John"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The power and limitations of static binary search trees with lazy finger
Presenjit Bose
,
Karim Douïeb
,
John Iacono
,
Stefan Langerman
Lecture Notes in Computer Science
8889
, 2014, pp. 181-192
Necklaces, convolutions, and
X+Y
David Bremner
,
Timothy M. Chan
,
Erik D. Demaine
,
Jeff Erickson
,
Ferran Hurtado
,
John Iacono
,
Stefan Langerman
,
Mihai Pȃtraşcu
,
Perouz Taslakian
Algorithmica
69
(2), 2014, pp. 294-314
Cache-oblivious persistence
Pooya Davoodi
,
Jeremy T. Fineman
,
John Iacono
,
Özgür Özkan
Lecture Notes in Computer Science
8737
, 2014, pp. 296-308
Why some heaps support constant-amortized-time decrease-key operations, and others do not
John Iacono
,
Özgür Özkan
Lecture Notes in Computer Science
8572
, 2014, pp. 637-649
Combining binary search trees
Erik D. Demaine
,
John Iacono
,
Stefan Langerman
,
Özgür Özkan
Lecture Notes in Computer Science
7965
, 2013, pp. 388-399
On the hierarchy of distribution-sensitive properties for data structures
Amr Elmasry
,
Arash Farzan
,
John Iacono
Acta Informatica
50
(4), 2013, pp. 289-295
Encodings for range selection and top-
k
queries
Roberto Grossi
,
John Iacono
,
Gonzalo Navarro
,
Rajeev Raman
,
Satti Srinivasa Rao
Lecture Notes in Computer Science
8125
, 2013, pp. 553-564
Piecewise-linear approximations of uncertain functions
Mohammad Ali Abam
,
Mark de Berg
,
Amirali Khosravi
Lecture Notes in Computer Science
6844
, 2011, pp. 1-12
A constant factor approximation algorithm for boxicity of circular arc graphs
Abhijin Adiga
,
Jasine Babu
,
L. Sunil Chandran
Lecture Notes in Computer Science
6844
, 2011, pp. 13-24
On the area requirements of Euclidean minimum spanning trees
Patrizio Angelini
,
Till Bruckdorfer
,
Marco Chiesa
,
Fabrizio Frati
,
Michael Kaufmann
,
Claudio Sqarcella
Lecture Notes in Computer Science
6844
, 2011, pp. 25-36
Multi-target ray searching problems
Spyros Angelopoulos
,
Alejandro López-Ortiz
,
Konstantinos Panagiotou
Lecture Notes in Computer Science
6844
, 2011, pp. 37-48
Convex transversals
Esther M. Arkin
,
Claudia Dieckmann
,
Christian Knauer
,
Joseph S.B. Mitchell
,
Valentin Polishchuk
,
Schlipf
,
Lena
,
Shang Yang
Lecture Notes in Computer Science
6844
, 2011, pp. 49-60
Witness rectangle graphs
Boris Aronov
,
Muriel Dulieu
,
Ferran Hurtado
Lecture Notes in Computer Science
6844
, 2011, pp. 73-85
How to cover a point set with a V-shape of minimum width
Boris Aronov
,
Muriel Dulieu
Lecture Notes in Computer Science
6844
, 2011, pp. 61-72
The cost of cache-oblivious searching
Michael A. Bender
,
Gerth Stlting Brodal
,
Rolf Fagerberg
,
Dongdong Ge
,
Simai He
,
Haodong Hu
,
John Iacono
,
Alejandro López-Ortiz
Algorithmica
61
(2), 2011, pp. 463-505
Faster optimal algorithms for segment minimization with small maximal value
Therese Biedl
,
Stephane Durocher
,
Céline Engelbeen
,
Samuel Fiorini
,
Maxwell Young
Lecture Notes in Computer Science
6844
, 2011, pp. 86-97
Orthogonal cartograms with few corners per face
Therese Biedl
,
Lesvia Elena Ruiz Velázquez
Lecture Notes in Computer Science
6844
, 2011, pp. 98-109
Smoothed analysis of partitioning algorithms for Euclidean functionals
Markus Bläser
,
Bodo Manthey
,
B.V. Raghavendra Rao
Lecture Notes in Computer Science
6844
, 2011, pp. 110-121
Feedback vertex set in mixed graphs
Paul Bonsma
,
Daniel Lokshtanov
Lecture Notes in Computer Science
6844
, 2011, pp. 122-133
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Lecture Notes in Computer Science
6844
, 2011, pp. 134-146
Path minima queries in dynamic weighted trees
Gerth Stlting Brodal
,
Pooya Davoodi
,
S. Srinivasa Rao
Lecture Notes in Computer Science
6844
, 2011, pp. 290-301
Frequency capping in online advertising
Niv Buchbinder
,
Moran Feldman
,
Arpita Ghosh
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
6844
, 2011, pp. 147-158
Adjacency-preserving spatial treemaps
Kevin Buchin
,
David Eppstein
,
Maarten Löffler
,
Martin Nöllenburg
,
Rodrigo I. Silveira
Lecture Notes in Computer Science
6844
, 2011, pp. 159-170
Register loading via linear programming
Gruia Calinescu
,
Minming Li
Lecture Notes in Computer Science
6844
, 2011, pp. 171-182
Connecting a set of circles with minimum sum of radii
Erin Wolf Chambers
,
Sándor P. Fekete
,
Hella-Franziska Hoffmann
,
Dimitri Marinakis
,
Joseph S.B. Mitchell
,
Venkatesh Srinivasan
,
Ulrike Stege
,
Sue Whitesides
Lecture Notes in Computer Science
6844
, 2011, pp. 183-194
Seiten 1
2
3
4
>