The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Graham Cormode: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gultekin Özsoyoglu, Nevzat Hurkan Balkir, Graham Cormode, Z. Meral Özsoyoglu
    Electronic Books in Digital Libraries. [Citation Graph (0, 0)][DBLP]
    ADL, 2000, pp:5-14 [Conf]
  2. Graham Cormode, Minos N. Garofalakis, Dimitris Sacharidis
    Fast Approximate Wavelet Tracking on Streams. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:4-22 [Conf]
  3. Graham Cormode, S. Muthukrishnan
    Estimating Dominance Norms of Multiple Data Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:148-160 [Conf]
  4. Graham Cormode, S. Muthukrishnan, Süleyman Cenk Sahinalp
    Permutation Editing and Matching via Embeddings. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:481-492 [Conf]
  5. Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan
    Fast Mining of Massive Tabular Data via Approximate Distance Computations. [Citation Graph (0, 0)][DBLP]
    ICDE, 2002, pp:605-0 [Conf]
  6. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Effective Computation of Biased Quantiles over Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:20-31 [Conf]
  7. Graham Cormode, S. Muthukrishnan, Wei Zhuang
    What's Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:57- [Conf]
  8. Graham Cormode, S. Muthukrishnan
    What's New: Finding Significant Differences in Network Data Streams. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  9. Graham Cormode, S. Muthukrishnan
    An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:29-38 [Conf]
  10. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Space- and time-efficient deterministic algorithms for biased quantiles over data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:263-272 [Conf]
  11. Graham Cormode, S. Muthukrishnan
    What's hot and what's not: tracking most frequent items dynamically. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:296-306 [Conf]
  12. Graham Cormode, S. Muthukrishnan
    Space efficient mining of multigraph streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:271-282 [Conf]
  13. Graham Cormode, S. Muthukrishnan
    Summarizing and Mining Skewed Data Streams. [Citation Graph (0, 0)][DBLP]
    SDM, 2005, pp:- [Conf]
  14. Graham Cormode, Minos N. Garofalakis, S. Muthukrishnan, Rajeev Rastogi
    Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2005, pp:25-36 [Conf]
  15. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:155-166 [Conf]
  16. Graham Cormode, Theodore Johnson, Flip Korn, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava
    Holistic UDAFs at streaming speeds. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:35-46 [Conf]
  17. Ram Keralapura, Graham Cormode, Jeyashankher Ramamirtham
    Communication-efficient distributed monitoring of thresholded counts. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2006, pp:289-300 [Conf]
  18. Graham Cormode, S. Muthukrishnan
    Combinatorial Algorithms for Compressed Sensing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:280-294 [Conf]
  19. Graham Cormode, S. Muthukrishnan
    The string edit distance matching problem with moves. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:667-676 [Conf]
  20. Graham Cormode, S. Muthukrishnan
    Substring compression problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:321-330 [Conf]
  21. Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin
    Communication complexity of document exchange. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:197-206 [Conf]
  22. Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan
    Comparing Data Streams Using Hamming Norms (How to Zero In). [Citation Graph (0, 0)][DBLP]
    VLDB, 2002, pp:335-345 [Conf]
  23. Graham Cormode, Minos N. Garofalakis
    Sketching Streams Through the Net: Distributed Approximate Query Tracking. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:13-24 [Conf]
  24. Graham Cormode, Minos N. Garofalakis
    Streaming in a Connected World. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:1266- [Conf]
  25. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Finding Hierarchical Heavy Hitters in Data Streams. [Citation Graph (0, 0)][DBLP]
    VLDB, 2003, pp:464-475 [Conf]
  26. Graham Cormode, S. Muthukrishnan, Irina Rozenbaum
    Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:25-36 [Conf]
  27. Graham Cormode, Minos N. Garofalakis
    Efficient Strategies for Continuous Distributed Tracking Tasks. [Citation Graph (0, 0)][DBLP]
    IEEE Data Eng. Bull., 2005, v:28, n:1, pp:33-39 [Journal]
  28. Graham Cormode, S. Muthukrishnan
    An improved data stream summary: the count-min sketch and its applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:55, n:1, pp:58-75 [Journal]
  29. Graham Cormode, S. Muthukrishnan
    The string edit distance matching problem with moves. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  30. Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan
    Comparing Data Streams Using Hamming Norms (How to Zero In). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2003, v:15, n:3, pp:529-540 [Journal]
  31. Gultekin Özsoyoglu, Nevzat Hurkan Balkir, Z. Meral Özsoyoglu, Graham Cormode
    On Automated Lesson Construction from Electronic Textbooks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2004, v:16, n:3, pp:317-331 [Journal]
  32. Graham Cormode, S. Muthukrishnan
    What's hot and what's not: tracking most frequent items dynamically. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2005, v:30, n:1, pp:249-278 [Journal]
  33. Graham Cormode, S. Muthukrishnan
    What's new: finding significant differences in network data streams. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:6, pp:1219-1232 [Journal]
  34. Sumit Ganguly, Graham Cormode
    On Estimating Frequency Moments of Data Streams. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:479-493 [Conf]
  35. Graham Cormode, S. Muthukrishnan, Wei Zhuang
    Conquering the Divide: Continuous Clustering of Distributed Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1036-1045 [Conf]
  36. Graham Cormode, Srikanta Tirthapura, Bojian Xu
    Time-decaying sketches for sensor data aggregation. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:215-224 [Conf]
  37. Graham Cormode, Minos N. Garofalakis
    Streaming in a connected world: querying and tracking distributed data streams. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2007, pp:1178-1181 [Conf]
  38. Graham Cormode, Minos N. Garofalakis
    Sketching probabilistic data streams. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2007, pp:281-292 [Conf]
  39. Amit Chakrabarti, Graham Cormode, Andrew McGregor
    A near-optimal algorithm for computing the entropy of a stream. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:328-335 [Conf]

  40. Streaming in a connected world: querying and tracking distributed data streams. [Citation Graph (, )][DBLP]


  41. Streaming Graph Computations with a Helpful Advisor. [Citation Graph (, )][DBLP]


  42. Annotations in Data Streams. [Citation Graph (, )][DBLP]


  43. On Signatures for Communication Graphs. [Citation Graph (, )][DBLP]


  44. Exponentially Decayed Aggregates on Data Streams. [Citation Graph (, )][DBLP]


  45. Histograms and Wavelets on Probabilistic Data. [Citation Graph (, )][DBLP]


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


  47. Forward Decay: A Practical Time Decay Model for Streaming Systems. [Citation Graph (, )][DBLP]


  48. Anonymized Data: Generation, models, usage. [Citation Graph (, )][DBLP]


  49. Applying Link-Based Classification to Label Blogs. [Citation Graph (, )][DBLP]


  50. Space-optimal heavy hitters with strong error bounds. [Citation Graph (, )][DBLP]


  51. Approximation algorithms for clustering uncertain data. [Citation Graph (, )][DBLP]


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


  53. Time-decaying aggregates in out-of-order streams. [Citation Graph (, )][DBLP]


  54. Time-Decayed Correlated Aggregates over Data Streams. [Citation Graph (, )][DBLP]


  55. Estimating the confidence of conditional functional dependencies. [Citation Graph (, )][DBLP]


  56. Anonymized data: generation, models, usage. [Citation Graph (, )][DBLP]


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


  58. Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors. [Citation Graph (, )][DBLP]


  59. Robust lower bounds for communication and stream computation. [Citation Graph (, )][DBLP]


  60. Privacy in dynamic social networks. [Citation Graph (, )][DBLP]


  61. Finding the frequent items in streams of data. [Citation Graph (, )][DBLP]


  62. Histograms and Wavelets on Probabilistic Data [Citation Graph (, )][DBLP]


  63. Streaming Graph Computations with a Helpful Advisor [Citation Graph (, )][DBLP]


  64. Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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