| * | 2009 |
|---|
| 12 | EE | Enoch Peserico,
Luca Pretto:
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank.
COCOON 2009: 348-357 |
| 11 | EE | Enoch Peserico:
Brief announcement: (more) efficient pruning of ad-hoc wireless networks.
PODC 2009: 320-321 |
| 10 | EE | Paolo Bertasi,
Marco Bressan,
Enoch Peserico:
psort, Yet Another Fast Stable Sorting Software.
SEA 2009: 76-88 |
| 9 | EE | Enoch Peserico,
Luca Pretto:
Score and rank convergence of HITS.
SIGIR 2009: 770-771 |
| 8 | EE | Marco Bressan,
Enoch Peserico:
Choose the Damping, Choose the Ranking?.
WAW 2009: 76-89 |
| 2008 |
|---|
| 7 | EE | Enoch Peserico,
Luca Pretto:
The rank convergence of HITS can be slow
CoRR abs/0807.3006: (2008) |
| 2006 |
|---|
| 6 | EE | Enoch Peserico,
Larry Rudolph:
Robust network connectivity: when it's the big picture that matters.
SIGMETRICS/Performance 2006: 299-310 |
| 2005 |
|---|
| 5 | EE | Giorgio Satta,
Enoch Peserico:
Some Computational Complexity Results for Synchronous Context-Free Grammars.
HLT/EMNLP 2005 |
| 2004 |
|---|
| 4 | EE | Enoch Peserico:
The Lazy Adversary Conjecture Fails.
Theory Comput. Syst. 37(3): 397-403 (2004) |
| 2003 |
|---|
| 3 | EE | Enoch Peserico:
Online paging with arbitrary associativity.
SODA 2003: 555-564 |
| 2002 |
|---|
| 2 | EE | Enoch Peserico:
The lazy adversary conjecture fails.
SPAA 2002: 143-144 |
| 2001 |
|---|
| 1 | EE | Gianfranco Bilardi,
Enoch Peserico:
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies.
ICALP 2001: 128-139 |
