The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Mitzenmacher: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
    Min-Wise Independent Permutations (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1998, pp:327-336 [Conf]
  2. Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher
    Human-Guided Tabu Search. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:41-47 [Conf]
  3. Yan-Cheng Chang, Michael Mitzenmacher
    Privacy Preserving Keyword Searches on Remote Encrypted Data. [Citation Graph (0, 0)][DBLP]
    ACNS, 2005, pp:442-455 [Conf]
  4. Markus Chimani, Neal Lesh, Michael Mitzenmacher, Candy L. Sidner, Hidetoshi Tanaka
    A Case Study in Large-Scale Interactive Optimization. [Citation Graph (0, 0)][DBLP]
    Artificial Intelligence and Applications, 2005, pp:24-29 [Conf]
  5. Michael Mitzenmacher, Sean Owen
    Estimating Resemblance of MIDI Documents. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:78-90 [Conf]
  6. Neal Lesh, Michael Mitzenmacher
    Interactive data summarization: an example application. [Citation Graph (0, 0)][DBLP]
    AVI, 2004, pp:183-187 [Conf]
  7. Andrei Z. Broder, Michael Mitzenmacher
    Pattern-based Compression of Text Images. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1996, pp:300-309 [Conf]
  8. Micah Adler, Michael Mitzenmacher
    Towards Compressing Web Graphs. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:203-212 [Conf]
  9. Frederic H. Behr, Victoria Fossum, Michael Mitzenmacher, David Xiao
    Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression. [Citation Graph (0, 0)][DBLP]
    DCC, 2003, pp:416- [Conf]
  10. Jimming Cheng, Michael Mitzenmacher
    The Markov Expert for Finding Episodes in Time Series. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:454- [Conf]
  11. Michael Mitzenmacher
    On the Hardness of Finding Optimal Multiple Preset Dictionaries. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:411-0 [Conf]
  12. Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese
    An Improved Construction for Counting Bloom Filters. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:684-695 [Conf]
  13. Adam Kirsch, Michael Mitzenmacher
    Less Hashing, Same Performance: Building a Better Bloom Filter. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:456-467 [Conf]
  14. Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher
    Stochastic Shortest Paths Via Quasi-convex Maximization. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:552-563 [Conf]
  15. Susanne Albers, Moses Charikar, Michael Mitzenmacher
    Delayed Information and Action in On-line Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:71-81 [Conf]
  16. Claire Kenyon, Michael Mitzenmacher
    Linear Waste of Best Fit Bin Packing on Skewed Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:582-589 [Conf]
  17. Michael Mitzenmacher
    Load Balancing and Density Dependent Jump Markov Processes (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:213-222 [Conf]
  18. Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah
    Load Balancing with Memory. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:799-808 [Conf]
  19. Susanne Albers, Michael Mitzenmacher
    Average Case Analyses of List Update Algorithms, with Applications to Data Compression. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:514-525 [Conf]
  20. Peter R. Pietzuch, Jonathan Ledlie, Michael Mitzenmacher, Margo I. Seltzer
    Network-Aware Overlays with Network Coordinates. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2006, pp:12- [Conf]
  21. Andrei Z. Broder, Michael Mitzenmacher
    Using Multiple Hash Functions to Improve IP Lookups. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1454-1463 [Conf]
  22. John W. Byers, Michael Luby, Michael Mitzenmacher
    Fine-Grained Layered Multicast. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1143-1151 [Conf]
  23. John W. Byers, Michael Luby, Michael Mitzenmacher
    Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:275-283 [Conf]
  24. Ashish Goel, Michael Mitzenmacher
    Exact sampling of TCP Window States. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  25. John W. Byers, Jeffrey Considine, Michael Mitzenmacher
    Simple Load Balancing for Distributed Hash Tables. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2003, pp:80-87 [Conf]
  26. Subhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher
    X-Tolerant Signature Analysis. [Citation Graph (0, 0)][DBLP]
    ITC, 2004, pp:432-441 [Conf]
  27. John W. Byers, Michael Frumin, Gavin B. Horn, Michael Luby, Michael Mitzenmacher, Alex Roetter, William Shaver
    FLID-DL. [Citation Graph (0, 0)][DBLP]
    Networked Group Communication, 2000, pp:71-81 [Conf]
  28. Andrei Z. Broder, Michael Mitzenmacher
    Optmial plans for aggregation. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:144-152 [Conf]
  29. Eli Gafni, Michael Mitzenmacher
    Analysis of Timing-Based Mutual Exclusion with Random Times. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:13-21 [Conf]
  30. Michael Mitzenmacher
    Compressed bloom filters. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:144-150 [Conf]
  31. Michael Mitzenmacher
    How Useful Is Old Information? (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:83-91 [Conf]
  32. Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
    A Derandomization Using Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:15-24 [Conf]
  33. Andrei Z. Broder, Michael Mitzenmacher
    Completeness and Robustness Properties of Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:1-10 [Conf]
  34. Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal
    On Balls and Bins with Deletions. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:145-158 [Conf]
  35. Neal Lesh, Michael Mitzenmacher, Sue Whitesides
    A complete and effective move set for simplified protein folding. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2003, pp:188-195 [Conf]
  36. John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost
    Informed content delivery across adaptive overlay networks. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2002, pp:47-60 [Conf]
  37. John W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege
    A Digital Fountain Approach to Reliable Distribution of Bulk Data. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 1998, pp:56-67 [Conf]
  38. Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese
    Beyond bloom filters: from approximate membership checks to approximate state machines. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2006, pp:315-326 [Conf]
  39. Susanne Albers, Michael Mitzenmacher
    Average-Case Analyses of First Fit and Random Fit Bin Packing. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:290-299 [Conf]
  40. Justin A. Boyan, Michael Mitzenmacher
    IMproved results for route planning in stochastic transportation. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:895-902 [Conf]
  41. Andrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher
    Improved classification via connectivity information. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:576-585 [Conf]
  42. Andrei Z. Broder, Michael Mitzenmacher
    Multidimensional balanced allocations. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:195-196 [Conf]
  43. Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll
    Unscrambling Address Lines. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:870-871 [Conf]
  44. Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher
    Balls and bins models with feedback. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:308-315 [Conf]
  45. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
    An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:616-624 [Conf]
  46. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi
    Analysis of Random Processes via And-Or Tree Evaluation. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:364-373 [Conf]
  47. John W. Byers, Jeffrey Considine, Michael Mitzenmacher
    Geometric generalizations of the power of two choices. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:54-63 [Conf]
  48. Michael Mitzenmacher
    Bounds on the Greedy Routing Algorithm for Array Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:346-353 [Conf]
  49. Michael Mitzenmacher
    Constant Time per Edge is Optimal on Rooted Tree Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:162-169 [Conf]
  50. Michael Mitzenmacher
    On the Analysis of Randomized Load Balancing Schemes. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:292-301 [Conf]
  51. Michael Mitzenmacher
    Analyses of Load Stealing Models Based on Differential Equations. [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:212-221 [Conf]
  52. Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen
    Parallel randomized load balancing (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:238-247 [Conf]
  53. Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking
    Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:378-388 [Conf]
  54. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
    Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:249-258 [Conf]
  55. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann
    Practical Loss-Resilient Codes. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:150-159 [Conf]
  56. Michael Mitzenmacher
    Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:1- [Conf]
  57. Susanne Albers, Michael Mitzenmacher
    Average Case Analyses of List Update Algorithms, with Applications to Data Compression. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:3, pp:312-329 [Journal]
  58. Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork
    On near-uniform URL sampling. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2000, v:33, n:1-6, pp:295-308 [Journal]
  59. Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork
    Measuring Index Quality Using Random Walks on the Web. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1999, v:31, n:11-16, pp:1291-1303 [Journal]
  60. Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer
    A Scaling Result for Explosive Processes. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  61. Michael Mitzenmacher
    Studying Balanced Allocations With Differential Equations [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:5, pp:- [Journal]
  62. Michael Mitzenmacher
    Constant Time per Edge is Optimal on Rooted Tree Networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1997, v:10, n:4, pp:189-197 [Journal]
  63. Subhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher, Nishant Patil
    X-Tolerant Test Response Compaction. [Citation Graph (0, 0)][DBLP]
    IEEE Design & Test of Computers, 2005, v:22, n:6, pp:566-574 [Journal]
  64. Susanne Albers, Moses Charikar, Michael Mitzenmacher
    Delayed Information and Action in On-Line Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:170, n:2, pp:135-152 [Journal]
  65. Susanne Albers, Michael Mitzenmacher
    Revisiting the Counter Algorithms for List Update. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:3, pp:155-160 [Journal]
  66. Neal Lesh, Michael Mitzenmacher
    BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:161-169 [Journal]
  67. Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher
    Exhaustive approaches to 2D rectangular perfect packings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:1, pp:7-14 [Journal]
  68. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
    Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:630-659 [Journal]
  69. Michael Mitzenmacher
    Bounds on the Greedy Routing Algorithm for Array Networks. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:317-327 [Journal]
  70. Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
    A derandomization using min-wise independent permutations. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:11-20 [Journal]
  71. Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher
    New heuristic and interactive approaches to 2D rectangular strip packing. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
  72. Michael Mitzenmacher
    On the Analysis of Randomized Load Balancing Schemes. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:3, pp:361-386 [Journal]
  73. Michael Mitzenmacher
    Analyses of Load Stealing Models Based on Families of Differential Equations. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:1, pp:77-98 [Journal]
  74. Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen
    Parallel randomized load balancing. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:2, pp:159-188 [Journal]
  75. Susanne Albers, Michael Mitzenmacher
    Average-case analyses of first fit and random fit bin packing. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:3, pp:240-259 [Journal]
  76. Andrei Z. Broder, Michael Mitzenmacher
    Completeness and robustness properties of min-wise independent permutations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:1, pp:18-30 [Journal]
  77. Claire Kenyon, Michael Mitzenmacher
    Linear waste of best fit bin packing on skewed distributions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:3, pp:441-464 [Journal]
  78. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
    An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1962-1975 [Journal]
  79. Eli Gafni, Michael Mitzenmacher
    Analysis of Timing-Based Mutual Exclusion with Random Times. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:816-837 [Journal]
  80. Graham Louth, Michael Mitzenmacher, Frank Kelly
    Computational Complexity of Loss Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:125, n:1, pp:45-59 [Journal]
  81. Brian Conrad, Michael Mitzenmacher
    Power laws for monkeys typing randomly: the case of unequal probabilities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:7, pp:1403-1414 [Journal]
  82. Aleksandar Kavcic, Xiao Ma, Michael Mitzenmacher
    Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:7, pp:1636-1652 [Journal]
  83. Michael Luby, Michael Mitzenmacher
    Verification-based decoding for packet-based low-density parity-check codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:120-127 [Journal]
  84. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
    Efficient erasure correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:569-584 [Journal]
  85. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
    Improved low-density parity-check codes using irregular graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:585-598 [Journal]
  86. Michael Mitzenmacher
    On the hardness of finding optimal multiple preset dictionaries. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:7, pp:1536-1539 [Journal]
  87. Michael Mitzenmacher, Eleni Drinea
    A Simple Lower Bound for the Capacity of the Deletion Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:10, pp:4657-4660 [Journal]
  88. Eleni Drinea, Michael Mitzenmacher
    On Lower Bounds for the Capacity of Deletion Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:10, pp:4648-4657 [Journal]
  89. Michael Mitzenmacher
    Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large q. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5496-5501 [Journal]
  90. Michael Mitzenmacher, Rajmohan Rajaraman
    Towards More Complete Models of TCP Latency and Throughput. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2001, v:20, n:2, pp:137-160 [Journal]
  91. John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost
    Informed content delivery across adaptive overlay networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2004, v:12, n:5, pp:767-780 [Journal]
  92. John W. Byers, Gu-In Kwon, Michael Luby, Michael Mitzenmacher
    Fine-grained layered multicast with STAIR. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:14, n:1, pp:81-93 [Journal]
  93. Michael Mitzenmacher
    Compressed bloom filters. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:5, pp:604-612 [Journal]
  94. Michael Mitzenmacher
    How Useful Is Old Information? [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:1, pp:6-20 [Journal]
  95. Michael Mitzenmacher
    The Power of Two Choices in Randomized Load Balancing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:10, pp:1094-1104 [Journal]

  96. An Analysis of Random-Walk Cuckoo Hashing. [Citation Graph (, )][DBLP]


  97. More Robust Hashing: Cuckoo Hashing with a Stash. [Citation Graph (, )][DBLP]


  98. Some Open Questions Related to Cuckoo Hashing. [Citation Graph (, )][DBLP]


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


  100. Tight Thresholds for Cuckoo Hashing via XORSAT. [Citation Graph (, )][DBLP]


  101. HEXA: Compact Data Structures for Faster Packet Processing. [Citation Graph (, )][DBLP]


  102. Network monitoring using traffic dispersion graphs (tdgs). [Citation Graph (, )][DBLP]


  103. The Power of One Move: Hashing Schemes for Hardware. [Citation Graph (, )][DBLP]


  104. Network Coding Meets TCP. [Citation Graph (, )][DBLP]


  105. An Economically-Principled Generative Model of AS Graph Connectivity. [Citation Graph (, )][DBLP]


  106. On compressing social networks. [Citation Graph (, )][DBLP]


  107. Carousel: Scalable Logging for Intrusion Prevention Systems. [Citation Graph (, )][DBLP]


  108. An efficient rigorous approach for identifying statistically significant frequent itemsets. [Citation Graph (, )][DBLP]


  109. Information asymmetries in pay-per-bid auctions. [Citation Graph (, )][DBLP]


  110. Why simple hash functions work: exploiting the entropy in a data stream. [Citation Graph (, )][DBLP]


  111. Trace reconstruction with constant deletion probability and related results. [Citation Graph (, )][DBLP]


  112. The hiring problem and Lake Wobegon strategies. [Citation Graph (, )][DBLP]


  113. AMS Without 4-Wise Independence on Product Domains. [Citation Graph (, )][DBLP]


  114. A Survey of Results for Deletion Channels and Related Synchronization Channels. [Citation Graph (, )][DBLP]


  115. Adaptive weighing designs for keyword value computation. [Citation Graph (, )][DBLP]


  116. Exploiting dynamicity in graph-based traffic analysis: techniques and applications. [Citation Graph (, )][DBLP]


  117. An improved analysis of the lossy difference aggregator. [Citation Graph (, )][DBLP]


  118. Network coding meets TCP [Citation Graph (, )][DBLP]


  119. Interfacing network coding with TCP: an implementation [Citation Graph (, )][DBLP]


  120. Tight Thresholds for Cuckoo Hashing via XORSAT [Citation Graph (, )][DBLP]


  121. Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes Bank [Citation Graph (, )][DBLP]


  122. An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets [Citation Graph (, )][DBLP]


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


  124. MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations [Citation Graph (, )][DBLP]


  125. Heapable Sequences and Subsequences [Citation Graph (, )][DBLP]


Search in 0.050secs, Finished in 0.056secs
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