Search the dblp DataBase

Publications of Author

1. Gianfranco Bilardi, Enoch Peserico
   A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. [Citation Graph (0, 0)][DBLP]
   ICALP, 2001, pp:128-139 [Conf]
   
2. Giorgio Satta, Enoch Peserico
   Some Computational Complexity Results for Synchronous Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
   HLT/EMNLP, 2005, pp:- [Conf]
   
3. Enoch Peserico, Larry Rudolph
   Robust network connectivity: when it's the big picture that matters. [Citation Graph (0, 0)][DBLP]
   SIGMETRICS/Performance, 2006, pp:299-310 [Conf]
   
4. Enoch Peserico
   Online paging with arbitrary associativity. [Citation Graph (0, 0)][DBLP]
   SODA, 2003, pp:555-564 [Conf]
   
5. Enoch Peserico
   The lazy adversary conjecture fails. [Citation Graph (0, 0)][DBLP]
   SPAA, 2002, pp:143-144 [Conf]
   
6. Enoch Peserico
   The Lazy Adversary Conjecture Fails. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2004, v:37, n:3, pp:397-403 [Journal]
   
7. 
   HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank. [Citation Graph (, )][DBLP]
   
   
8. 
   Brief announcement: (more) efficient pruning of ad-hoc wireless networks. [Citation Graph (, )][DBLP]
   
   
9. 
   Score and rank convergence of HITS. [Citation Graph (, )][DBLP]
   
   
10. 
    Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints. [Citation Graph (, )][DBLP]
    
    
11. 
    Choose the Damping, Choose the Ranking?. [Citation Graph (, )][DBLP]
    
    
12. 
    psort, Yet Another Fast Stable Sorting Software. [Citation Graph (, )][DBLP]
    
    
13. 
    Urban Hitchhiking. [Citation Graph (, )][DBLP]
    
    
14. 
    The rank convergence of HITS can be slow [Citation Graph (, )][DBLP]