1. bib.BibAuthor.None, "Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network" , , , .
  2. bib.BibAuthor.None, "Faster walks in graphs : A O ( n² ) time-space trade-off for undirected s- t connectivity" , , SODA, .
  3. bib.BibAuthor.None, "Random walks which prefer unvisited edges : Exploring high girth even degree expanders in linear time" , , PODC, .
  4. bib.BibAuthor.None, "CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data" , , SC, .
  5. bib.BibAuthor.None, "Keeping a Search Engine Index Fresh: Risk and optimality in estimating refresh rates for web pages" , , Proceedings of the 40th Symposium on the Interface: Computing Science and Statistics, Durham, NC, USA, .
  6. bib.BibAuthor.None, "Efficient leader election in complete networks" , , PDP, .
  7. bib.BibAuthor.None, "Using Name-Based Mappings to Increase Hit Rates" , , IEEE/ACM Trans. Netw. 6(1), .
  8. bib.BibAuthor.None, "Improved Deduplication through Parallel Binning" , , IPCCC, .
  9. bib.BibAuthor.None, "Extreme Binning: Scalable, Parallel Deduplication for Chunk-based File Backup" , , MASCOTS, .
  10. bib.BibAuthor.None, "A framework for analyzing and improving content-based chunking algorithms" , , , .
  11. bib.BibAuthor.None, "Outperforming LRU with an adaptive replacement cache algorithm" , , IEEE Computer 37(4), .
  12. bib.BibAuthor.None, Knowlege in Byzantine Message-Passing Systems , , E185 - Institut für Computersprachen, E182 - Institut Technische Informatik; Technische Universität Wien, .