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: Author="Yi, Ke"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cache-oblivious hashing
Rasmus Pagh
,
Zhewei Wei
,
Ke Yi
,
Qin Zhang
Algorithmica
69
(4), 2014, pp. 864-883
Equivalence between priority queues and sorting in external memory
Zhewei Wei
,
Ke Yi
Lecture Notes in Computer Science
8737
, 2014, pp. 830-841
Optimal tracking of distributed heavy hitters and quantiles
Ke Yi
,
Qin Zhang
Algorithmica
65
(1), 2013, pp. 206-223
An optimal dynamic data structure for stabbing-semigroup queries
Pankaj K. Agarwal
,
Lars Arge
,
Haim Kaplan
,
Eyal Molad
,
Robert Robert E. Tarjan
,
Ke Yi
SIAM Journal on Computing
41
(1), 2012, pp. 104-127
Continuous sampling from distributed streams
Graham Cormode
,
S. Muthukrishnan
,
Ke Yi
,
Qin Zhang
Journal of the ACM
59
(2), 2012, pp. 10: 1-25
Dynamic indexability and the optimality of B-trees
Ke Yi
Journal of the ACM
59
(4), 2012, pp. 21: 1-19
Approximate range searching in external memory
Micha Streppel
,
Ke Yi
Algorithmica
59
(2), 2011, pp. 115-128
Clustering with diversity
Jian Li
,
Ke Yi
,
Qin Zhang
Lecture Notes in Computer Science
6198
, 2010, pp. 188-200
Optimal external memory planar point enclosure
Lars Arge
,
Vasilis Samoladas
,
Ke Yi
Algorithmica
54
(3), 2009, pp. 337-352
Dynamic external hashing: The limit of buffering
Zhewei Wei
,
Ke Yi
,
Qin Zhang
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 253-259
A dynamic data structure for top-
k
queries on uncertain data
Jiang Chen
,
Ke Yi
Theoretical Computer Science
407
(1-3), 2008, pp. 310-317
Dynamic structures for top-
k
queries on uncertain data
Jiang Chen
,
Ke Yi
Lecture Notes in Computer Science
4835
, 2007, pp. 427-438
Approximate range searching in external memory
Micha Streppel
,
Ke Yi
Lecture Notes in Computer Science
4835
, 2007, pp. 536-548
I/O-efficient construction of constrained Delaunay triangulations
Pankaj K. Agarwal
,
Lars Arge
,
Ke Yi
Lecture Notes in Computer Science
3669
, 2005, pp. 355-366
Optimal external memory planar point enclosure
Lars Arge
,
Vasilis Samoladas
,
Ke Yi
Lecture Notes in Computer Science
3221
, 2004, pp. 40-52
I/O-efficient structures for orthogonal range-max and stabbing-max queries
Pankaj K. Agarwal
,
Lars Arge
,
Jun Yang
,
Ke Yi
Lecture Notes in Computer Science
2832
, 2003, pp. 7-18