default search action
Enoch Peserico
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Gilad Asharov
, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. J. ACM 70(1): 4:1-4:70 (2023) - [j10]Marco Bressan, Enoch Peserico, Luca Pretto:
Sublinear Algorithms for Local Graph-Centrality Estimation. SIAM J. Comput. 52(4): 968-1008 (2023) - [j9]Enoch Peserico, Michele Scquizzato
Matching on the Line Admits no o(√log n)-Competitive Algorithm. ACM Trans. Algorithms 19(3): 28:1-28:4 (2023) - 2022
- [c38]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Optimal Oblivious Parallel RAM. SODA 2022: 2459-2521 - [c37]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Online Parallel Paging with Optimal Makespan. SPAA 2022: 205-216 - 2021
- [c36]Enoch Peserico, Michele Scquizzato:
Matching on the Line Admits No o(√log n)-Competitive Algorithm. ICALP 2021: 103:1-103:3 - [c35]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Tight Bounds for Parallel Paging and Green Paging. SODA 2021: 3022-3041 - 2020
- [j8]Marco Bressan
On Approximating the Stationary Distribution of Time-Reversible Markov Chains. Theory Comput. Syst. 64(3): 444-466 (2020) - [c34]Gilad Asharov
OptORAMa: Optimal Oblivious RAM. EUROCRYPT (2) 2020: 403-432 - [c33]Gilad Asharov
Oblivious Parallel Tight Compaction. ITC 2020: 11:1-11:23 - [c32]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Green Paging and Parallel Paging. SPAA 2020: 493-495 - [i11]Enoch Peserico, Michele Scquizzato:
Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm. CoRR abs/2012.15593 (2020) - [i10]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Oblivious Parallel Tight Compaction. IACR Cryptol. ePrint Arch. 2020: 125 (2020) - [i9]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Optimal Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2020: 1292 (2020)
2010 – 2019
- 2019
- [c31]Enoch Peserico:
Paging with Dynamic Memory Capacity. STACS 2019: 56:1-56:18 - 2018
- [c30]Marco Bressan, Enoch Peserico, Luca Pretto:
Sublinear Algorithms for Local Graph Centrality Estimation. FOCS 2018: 709-718 - [c29]Marco Bressan
Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. SPAA 2018: 87-89 - [c28]Marco Bressan
On Approximating the Stationary Distribution of Time-reversible Markov Chains. STACS 2018: 18:1-18:14 - [i8]Marco Bressan, Enoch Peserico, Luca Pretto:
On approximating the stationary distribution of time-reversible Markov chains. CoRR abs/1801.00196 (2018) - [i7]Enoch Peserico:
Deterministic oblivious distribution (and tight compaction) in linear time. CoRR abs/1807.06719 (2018) - 2017
- [c27]Mattia Samory
Sizing Up the Troll: A Quantitative Characterization of Moderator-Identified Trolling in an Online Forum. CHI 2017: 6943-6947 - [c26]Mattia Samory
Quotes Reveal Community Structure and Interaction Dynamics. CSCW 2017: 322-335 - [c25]Mattia Samory, Cinzia Pizzi, Enoch Peserico:
How User Condition Affects Community Dynamics in a Forum on Autism. ICWSM 2017: 220-229 - 2016
- [c24]Mattia Samory
Content attribution ignoring content. WebSci 2016: 233-243 - [c23]Mattia Samory
Community structure and interaction dynamics through the lens of quotes. WebSci 2016: 358-359 - [i6]Marco Bressan, Enoch Peserico, Luca Pretto:
The Power of Local Information in PageRank. CoRR abs/1604.00202 (2016) - [i5]Mattia Samory, Enoch Peserico:
Community structure and interaction dynamics through the lens of quotes. CoRR abs/1604.04570 (2016) - 2015
- [c22]Mattia Samory
Quotes in forum.rpg.net. WebSci 2015: 52:1-52:2 - [i4]Marco Bressan, Enoch Peserico, Luca Pretto:
Simple set cardinality estimation through random sampling. CoRR abs/1512.07901 (2015) - 2014
- [j7]Francesca Musiani, Enoch Peserico:
A second-hand market for digital goods? First Monday 19(11) (2014) - [j6]Francesco Peruch, Federica Bogo, Michele Bonazza, Vincenzo-Maria Cappelleri, Enoch Peserico:
Simpler, Faster, More Accurate Melanocytic Lesion Segmentation Through MEDS. IEEE Trans. Biomed. Eng. 61(2): 557-565 (2014) - [c21]Mattia Samory, Marcella Mandanici, Sergio Canazza, Enoch Peserico:
The Counterpoint Game: Rules, Constraints and Computational Spaces. ICMC 2014 - [c20]Federica Bogo, Javier Romero, Enoch Peserico, Michael J. Black:
Automated Detection of New or Evolving Melanocytic Lesions Using a 3D Body Model. MICCAI (1) 2014: 593-600 - [i3]Marco Bressan, Enoch Peserico, Luca Pretto:
Approximating PageRank locally with sublinear query complexity. CoRR abs/1404.1864 (2014) - 2013
- [c19]Federica Bogo, Enoch Peserico:
Optimal throughput and delay in delay-tolerant networks with ballistic mobility. MobiCom 2013: 303-314 - [c18]Enoch Peserico:
Elastic paging. SIGMETRICS 2013: 349-350 - [c17]Francesco Peruch, Federica Bogo, Michele Bonazza, Marco Bressan, Vincenzo-Maria Cappelleri, Enoch Peserico:
Simple, Fast, Accurate Melanocytic Lesion Segmentation in 1D Colour Space. VISAPP (1) 2013: 191-200 - [c16]Marco Bressan, Enoch Peserico, Luca Pretto:
The power of local information in PageRank. WWW (Companion Volume) 2013: 179-180 - [i2]Enoch Peserico:
Paging with dynamic memory capacity. CoRR abs/1304.6007 (2013) - 2012
- [j5]Enoch Peserico, Luca Pretto:
HITS Can Converge Slowly, But Not Too Slowly, in Score and Rank. SIAM J. Discret. Math. 26(3): 1189-1209 (2012) - [c15]Federica Bogo, Mattia Samory
Psoriasis segmentation through chromatic regions and Geometric Active Contours. EMBC 2012: 5388-5391 - 2011
- [j4]Paolo Bertasi, Marco Bressan
psort, yet another fast stable sorting software. ACM J. Exp. Algorithmics 16 (2011) - [c14]Paolo Bertasi, Michele Bonazza, Marco Bressan
Datamation: A Quarter of a Century and Four Orders of Magnitude Later. CLUSTER 2011: 605-609 - [c13]M. Fiorese, Enoch Peserico, Alberto Silletti:
VirtualShave: Automated hair removal from digital dermatoscopic images. EMBC 2011: 5145-5148 - 2010
- [j3]Marco Bressan
Choose the damping, choose the ranking? J. Discrete Algorithms 8(2): 199-213 (2010) - [j2]Enoch Peserico, Alberto Silletti:
Is (N)PRI suitable for evaluating automated segmentation of cutaneous lesions? Pattern Recognit. Lett. 31(16): 2464-2467 (2010) - [c12]Marco Bressan
Urban Hitchhiking. FUN 2010: 68-76 - [c11]Enoch Peserico:
Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints. SPAA 2010: 176-177
2000 – 2009
- 2009
- [c10]Enoch Peserico, Luca Pretto:
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank. COCOON 2009: 348-357 - [c9]Enoch Peserico:
Brief announcement: (more) efficient pruning of ad-hoc wireless networks. PODC 2009: 320-321 - [c8]Enoch Peserico, Luca Pretto:
Score and rank convergence of HITS. SIGIR 2009: 770-771 - [c7]Marco Bressan
Choose the Damping, Choose the Ranking?. WAW 2009: 76-89 - [c6]Paolo Bertasi, Marco Bressan
psort, Yet Another Fast Stable Sorting Software. SEA 2009: 76-88 - 2008
- [i1]Enoch Peserico, Luca Pretto:
The rank convergence of HITS can be slow. CoRR abs/0807.3006 (2008) - 2007
- [b1]Enoch Peserico:
Huge networks, tiny faulty nodes. Massachusetts Institute of Technology, Cambridge, MA, USA, 2007 - 2006
- [c5]Enoch Peserico, Larry Rudolph:
Robust network connectivity: when it's the big picture that matters. SIGMETRICS/Performance 2006: 299-310 - 2005
- [c4]Giorgio Satta, Enoch Peserico:
Some Computational Complexity Results for Synchronous Context-Free Grammars. HLT/EMNLP 2005: 803-810 - 2004
- [j1]Enoch Peserico:
The Lazy Adversary Conjecture Fails. Theory Comput. Syst. 37(3): 397-403 (2004) - 2003
- [c3]Enoch Peserico:
Online paging with arbitrary associativity. SODA 2003: 555-564 - 2002
- [c2]Enoch Peserico:
The lazy adversary conjecture fails. SPAA 2002: 143-144 - 2001
- [c1]Gianfranco Bilardi, Enoch Peserico:
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. ICALP 2001: 128-139
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: