The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ke Yi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pankaj K. Agarwal, Lars Arge, Ke Yi
    I/O-efficient batched union-find and its applications to terrain analysis. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:167-176 [Conf]
  2. Pankaj K. Agarwal, Lars Arge, Ke Yi
    I/O-Efficient Construction of Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:355-366 [Conf]
  3. Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi
    I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:7-18 [Conf]
  4. Lars Arge, Vasilis Samoladas, Ke Yi
    Optimal External Memory Planar Point Enclosure. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:40-52 [Conf]
  5. Adam Silberstein, Hao He, Ke Yi, Jun Yang
    BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:285-296 [Conf]
  6. Ke Yi, Hai Yu, Jun Yang, Gangqiang Xia, Yuguo Chen
    Efficient Maintenance of Materialized Top-k Views. [Citation Graph (0, 0)][DBLP]
    ICDE, 2003, pp:189-200 [Conf]
  7. Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi
    Lexicographically optimal smoothing for broadband traffic multiplexing. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:68-77 [Conf]
  8. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
    The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:347-358 [Conf]
  9. Ke Yi, Hao He, Ioana Stanoi, Jun Yang
    Incremental Maintenance of XML Structural Indexes. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:491-502 [Conf]
  10. Pankaj K. Agarwal, Lars Arge, Ke Yi
    An optimal dynamic interval stabbing-max data structure? [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:803-812 [Conf]
  11. Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi
    Optimal Lexicographic Shaping of Aggregate Streaming Data. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:4, pp:398-408 [Journal]
  12. Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi
    Restricted strip covering and the sensor cover problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1056-1063 [Conf]
  13. Feifei Li, Ke Yi, Marios Hadjieleftheriou, George Kollios
    Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:147-158 [Conf]
  14. Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi
    Restricted Strip Covering and the Sensor Cover Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  15. The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. [Citation Graph (, )][DBLP]


  16. The hardness and approximation algorithms for l-diversity. [Citation Graph (, )][DBLP]


  17. TerraStream: from elevation data to watershed hierarchies. [Citation Graph (, )][DBLP]


  18. Clustering with Diversity. [Citation Graph (, )][DBLP]


  19. Efficient Processing of Top-k Queries in Uncertain Databases. [Citation Graph (, )][DBLP]


  20. Randomized Synopses for Query Assurance on Data Streams. [Citation Graph (, )][DBLP]


  21. Semantics of Ranking Queries for Probabilistic Data and Expected Ranks. [Citation Graph (, )][DBLP]


  22. A Concise Representation of Range Queries. [Citation Graph (, )][DBLP]


  23. Tree Indexing on Flash Disks. [Citation Graph (, )][DBLP]


  24. Correlation hiding by independence masking. [Citation Graph (, )][DBLP]


  25. Dynamic Structures for Top- k Queries on Uncertain Data. [Citation Graph (, )][DBLP]


  26. Approximate Range Searching in External Memory. [Citation Graph (, )][DBLP]


  27. Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes. [Citation Graph (, )][DBLP]


  28. Optimal tracking of distributed heavy hitters and quantiles. [Citation Graph (, )][DBLP]


  29. Indexing uncertain data. [Citation Graph (, )][DBLP]


  30. Optimal sampling from distributed streams. [Citation Graph (, )][DBLP]


  31. Cache-oblivious hashing. [Citation Graph (, )][DBLP]


  32. Finding frequent items in probabilistic data. [Citation Graph (, )][DBLP]


  33. Quality and efficiency in high dimensional nearest neighbor search. [Citation Graph (, )][DBLP]


  34. Ranking distributed probabilistic data. [Citation Graph (, )][DBLP]


  35. Probabilistic string similarity joins. [Citation Graph (, )][DBLP]


  36. Logging every footstep: quantile summaries for the entire history. [Citation Graph (, )][DBLP]


  37. Multi-dimensional online tracking. [Citation Graph (, )][DBLP]


  38. On the Cell Probe Complexity of Dynamic Membership. [Citation Graph (, )][DBLP]


  39. Algorithms for distributed functional monitoring. [Citation Graph (, )][DBLP]


  40. Dynamic external hashing: the limit of buffering. [Citation Graph (, )][DBLP]


  41. Optimal External Memory Planar Point Enclosure. [Citation Graph (, )][DBLP]


  42. Dynamic External Hashing: The Limit of Buffering [Citation Graph (, )][DBLP]


  43. Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries [Citation Graph (, )][DBLP]


  44. Optimal Tracking of Distributed Heavy Hitters and Quantiles [Citation Graph (, )][DBLP]


  45. The Hardness and Approximation Algorithms for L-Diversity [Citation Graph (, )][DBLP]


  46. Clustering with diversity [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002