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: Author="Har-Peled, Sariel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Convex hulls under uncertainty
Pankaj K. Agarwal
,
Sariel Har-Peled
,
Subhash Suri
,
Hakan Yıldız
,
Wuzhou Zhang
Lecture Notes in Computer Science
8737
, 2014, pp. 37-48
Robust proximity search for balls using sublinear space
Sariel Har-Peled
,
Nirman Kumar
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 315-326
Down the rabbit hole: Robust proximity search and density estimation in sublinear space
Sariel Har-Peled
,
Nirman Kumar
SIAM Journal on Computing
43
(4), 2014, pp. 1486-1511
Approximating the maximum overlap of polygons under translation
Sariel Har-Peled
,
Subhro Roy
Lecture Notes in Computer Science
8737
, 2014, pp. 542-553
Embeddings of surfaces, curves, and moving points in Euclidean space
Pankai K. Agarwal
,
Sariel Har-Peled
,
Hai Yu
SIAM Journal on Computing
42
(2), 2013, pp. 442-458
On the number of edges of fan-crossing free graphs
Otfried Cheong
,
Sariel Har-Peled
,
Heuna Kim
,
Hyo-Sil Kim
Lecture Notes in Computer Science
8283
, 2013, pp. 163-173
Jaywalking your dog: Computing the Fréchet distance with shortcuts
Anne Driemel
,
Sariel Har-Peled
SIAM Journal on Computing
42
(5), 2013, pp. 1830-1866
Approximate nearest neighbor search for low-dimensional queries
Sariel Har-Peled
,
Nirman Kumar
SIAM Journal on Computing
42
(1), 2013, pp. 138-159
Peeling the grid
Sariel Har-Peled
,
Bernard Lidický
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 650-655
Net and prune: A linear time algorithm for Euclidean distance problems
Sariel Har-Peled
,
Benjamin Adam Raichel
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 605-614
On the expected complexity of Voronoi diagrams on terrains
Anne Driemel
,
Sariel Har-Peled
,
Benjamin Raichel
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 101-110
Minimum convex partitions and maximum empty polytopes
Adrian Dumitrescu
,
Sariel Har-Peled
,
Csaba D. Tóth
Lecture Notes in Computer Science
7357
, 2012, pp. 213-224
Geometric packing under non-uniform constraints
Alina Ene
,
Sariel Har-Peled
,
Benjamin Raichel
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 11-20
How to walk your dog in the mountains with no magic leash
Sariel Har-Peled
,
Amir Nayyeri
,
Mohammad Salavatipour
,
Anastasios Sidiropoulos
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 121-130
Computing the Fréchet distance between folded polygons
Atlas F. Cook IV
,
Anne Driemel
,
Sariel Har-Peled
,
Jessica Sherette
,
Carola Wenk
Lecture Notes in Computer Science
6844
, 2011, pp. 267-278
Covering many or few points with unit disks
Mark de Berg
,
Cabello
,
Sariel Har-Peled
Theory of Computing Systems
45
(3), 2009, pp. 446-469
On approximating the depth and related problems
Boris Aronov
,
Sariel Har-Peled
SIAM Journal on Computing
38
(3), 2008, pp. 899-921
The Euclidean orienteering problem revisited
Ke Chen
,
Sariel Har-Peled
SIAM Journal on Computing
38
(1), 2008, pp. 385-397
Range medians
Sariel Har-Peled
,
S. Muthukrishnan
Lecture Notes in Computer Science
5193
, 2008, pp. 503-514
Fréchet distance for curves, revisited
Boris Aronov
,
Sariel Har-Peled
,
Christian Knauer
,
Yusu Wang
,
Carola Wenk
Lecture Notes in Computer Science
4168
, 2006, pp. 52-63
Guarding galleries and terrains
Alon Efrat
,
Sariel Har-Peled
Information Processing Letters
100
(6), 2006, pp. 238-245
Fast construction of nets in low-dimensional metrics and their applications
Sariel Har-Peled
,
Manor Mendel
SIAM Journal on Computing
35
(5), 2006, pp. 1148-1184
Coresets for discrete integration and clustering
Sariel Har-Peled
Lecture Notes in Computer Science
4337
, 2006, pp. 33-44
Near-linear time approximation algorithms for curve simplification
Pankaj K. Agarwal
,
Sariel Har-Peled
,
Nabil H. Mustafa
,
Yusu Wang
Algorithmica
42
(3-4), 2005, pp. 203-219
Geographic quorum system approximations
Paz Carmi
,
Shlomi Dolev
,
Sariel Har-Peled
,
Matthew J. Katz
,
Michael Segal
Algorithmica
41
(4), 2005, pp. 233-244
Seiten 1
2
>