A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. - Gianfranco Bilardi; Enoch Peserico (ICALP, 2001)

Online paging with arbitrary associativity. - Enoch Peserico (SODA, 2003)

The Lazy Adversary Conjecture Fails. - Enoch Peserico (Theory Comput. Syst., 2004)

Some Computational Complexity Results for Synchronous Context-Free Grammars. - Giorgio Satta; Enoch Peserico (HLT/EMNLP, 2005)

Robust network connectivity: when it's the big picture that matters. - Enoch Peserico; Larry Rudolph (SIGMETRICS/Performance, 2006)

Huge networks, tiny faulty nodes. - Enoch Peserico (2007)

The rank convergence of HITS can be slow - Enoch Peserico; Luca Pretto (CoRR, 2008)

Brief announcement: (more) efficient pruning of ad-hoc wireless networks. - Enoch Peserico (PODC, 2009)

Score and rank convergence of HITS. - Enoch Peserico; Luca Pretto (SIGIR, 2009)

psort, Yet Another Fast Stable Sorting Software. - Paolo Bertasi; Marco Bressan 002; Enoch Peserico (SEA, 2009)

Urban Hitchhiking. - Marco Bressan 002; Enoch Peserico (FUN, 2010)

Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints. - Enoch Peserico (SPAA, 2010)

Choose the damping, choose the ranking? - Marco Bressan 002; Enoch Peserico (J. Discrete Algorithms, 2010)

Is (N)PRI suitable for evaluating automated segmentation of cutaneous lesions? - Enoch Peserico; Alberto Silletti (Pattern Recognit. Lett., 2010)

Datamation: A Quarter of a Century and Four Orders of Magnitude Later. - Paolo Bertasi; Michele Bonazza; Marco Bressan 002; Enoch Peserico (CLUSTER, 2011)

VirtualShave: Automated hair removal from digital dermatoscopic images. - M. Fiorese; Enoch Peserico; Alberto Silletti (EMBC, 2011)

psort, yet another fast stable sorting software. - Paolo Bertasi; Marco Bressan 002; Enoch Peserico (ACM J. Exp. Algorithmics, 2011)

Psoriasis segmentation through chromatic regions and Geometric Active Contours. - Federica Bogo; Mattia Samory; Anna Belloni Fortina; Stefano Piaserico; Enoch Peserico (EMBC, 2012)

HITS Can Converge Slowly, But Not Too Slowly, in Score and Rank. - Enoch Peserico; Luca Pretto (SIAM J. Discret. Math., 2012)

Optimal throughput and delay in delay-tolerant networks with ballistic mobility. - Federica Bogo; Enoch Peserico (MobiCom, 2013)

Elastic paging. - Enoch Peserico (SIGMETRICS, 2013)

Simple, Fast, Accurate Melanocytic Lesion Segmentation in 1D Colour Space. - Francesco Peruch; Federica Bogo; Michele Bonazza; Marco Bressan 002; Vincenzo-Maria Cappelleri; Enoch Peserico (VISAPP (1), 2013)

The power of local information in PageRank. - Marco Bressan 002; Enoch Peserico; Luca Pretto (WWW (Companion Volume), 2013)

The Counterpoint Game: Rules, Constraints and Computational Spaces. - Mattia Samory; Marcella Mandanici; Sergio Canazza; Enoch Peserico (ICMC, 2014)

Automated Detection of New or Evolving Melanocytic Lesions Using a 3D Body Model. - Federica Bogo; Javier Romero 002; Enoch Peserico; Michael J. Black (MICCAI (1), 2014)

Approximating PageRank locally with sublinear query complexity. - Marco Bressan 002; Enoch Peserico; Luca Pretto (CoRR, 2014)

A second-hand market for digital goods? - Francesca Musiani; Enoch Peserico (First Monday, 2014)

Simpler, Faster, More Accurate Melanocytic Lesion Segmentation Through MEDS. - Francesco Peruch; Federica Bogo; Michele Bonazza; Vincenzo-Maria Cappelleri; Enoch Peserico (IEEE Trans. Biomed. Eng., 2014)

Quotes in forum.rpg.net. - Mattia Samory; Enoch Peserico (WebSci, 2015)

Simple set cardinality estimation through random sampling. - Marco Bressan 002; Enoch Peserico; Luca Pretto (CoRR, 2015)

Community structure and interaction dynamics through the lens of quotes. - Mattia Samory; Federica Bogo; Enoch Peserico (WebSci, 2016)

Content attribution ignoring content. - Mattia Samory; Enoch Peserico (WebSci, 2016)

Community structure and interaction dynamics through the lens of quotes. - Mattia Samory; Enoch Peserico (CoRR, 2016)

Sizing Up the Troll: A Quantitative Characterization of Moderator-Identified Trolling in an Online Forum. - Mattia Samory; Enoch Peserico (CHI, 2017)

Quotes Reveal Community Structure and Interaction Dynamics. - Mattia Samory; Vincenzo-Maria Cappelleri; Enoch Peserico (CSCW, 2017)

How User Condition Affects Community Dynamics in a Forum on Autism. - Mattia Samory; Cinzia Pizzi; Enoch Peserico (ICWSM, 2017)

Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. - Marco Bressan 002; Enoch Peserico; Luca Pretto (SPAA, 2018)

Deterministic oblivious distribution (and tight compaction) in linear time. - Enoch Peserico (CoRR, 2018)

Paging with Dynamic Memory Capacity. - Enoch Peserico (STACS, 2019)

Green Paging and Parallel Paging. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SPAA, 2020)

Matching on the line admits no $o( sqrt{ log n})$-competitive algorithm. - Enoch Peserico; Michele Scquizzato (CoRR, 2020)

Oblivious Parallel Tight Compaction. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Enoch Peserico; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Optimal Oblivious Parallel RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Enoch Peserico; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

On Approximating the Stationary Distribution of Time-Reversible Markov Chains. - Marco Bressan 002; Enoch Peserico; Luca Pretto (Theory Comput. Syst., 2020)

Tight Bounds for Parallel Paging and Green Paging. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SODA, 2021)

Online Parallel Paging with Optimal Makespan. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SPAA, 2022)

OptORAMa: Optimal Oblivious RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Kartik Nayak; Enoch Peserico; Elaine Shi (J. ACM, 2023)

Matching on the Line Admits no o(√log n)-Competitive Algorithm. - Enoch Peserico; Michele Scquizzato (ACM Trans. Algorithms, 2023)

Sublinear Algorithms for Local Graph-Centrality Estimation. - Marco Bressan 002; Enoch Peserico; Luca Pretto (SIAM J. Comput., 2023)