Enoch Peserico

SIAM J. Comput., August, 2023

Matching on the Line Admits no o(√log n)-Competitive Algorithm.

[BibT_eX]

[DOI]

Michele Scquizzato

ACM Trans. Algorithms, July, 2023

OptORAMa: Optimal Oblivious RAM.

[BibT_eX]

[DOI]

J. ACM, February, 2023

2022

Online Parallel Paging with Optimal Makespan.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021

Tight Bounds for Parallel Paging and Green Paging.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

On Approximating the Stationary Distribution of Time-Reversible Markov Chains.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Optimal Oblivious Parallel RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Oblivious Parallel Tight Compaction.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm.

[BibT_eX]

[DOI]

Michele Scquizzato

CoRR, 2020

Green Paging and Parallel Paging.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Paging with Dynamic Memory Capacity.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Deterministic oblivious distribution (and tight compaction) in linear time.

[BibT_eX]

[DOI]

CoRR, 2018

Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

2017

How User Condition Affects Community Dynamics in a Forum on Autism.

[BibT_eX]

[DOI]

Cinzia Pizzi

Proceedings of the Eleventh International Conference on Web and Social Media, 2017

Quotes Reveal Community Structure and Interaction Dynamics.

[BibT_eX]

[DOI]

Vincenzo-Maria Cappelleri

Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing, 2017

Sizing Up the Troll: A Quantitative Characterization of Moderator-Identified Trolling in an Online Forum.

[BibT_eX]

[DOI]

Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems, 2017

2016

Community structure and interaction dynamics through the lens of quotes.

[BibT_eX]

[DOI]

CoRR, 2016

Content attribution ignoring content.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM Conference on Web Science, 2016

Community structure and interaction dynamics through the lens of quotes.

[BibT_eX]

[DOI]

Federica Bogo

Proceedings of the 8th ACM Conference on Web Science, 2016

2015

Simple set cardinality estimation through random sampling.

[BibT_eX]

[DOI]

CoRR, 2015

Quotes in forum.rpg.net.

[BibT_eX]

[DOI]

Vincenzo-Maria Cappelleri

Proceedings of the ACM Web Science Conference, 2015

2014

Simpler, Faster, More Accurate Melanocytic Lesion Segmentation Through MEDS.

[BibT_eX]

[DOI]

Francesco Peruch

Federica Bogo

Michele Bonazza

IEEE Trans. Biomed. Eng., 2014

A second-hand market for digital goods?

[BibT_eX]

[DOI]

Francesca Musiani

First Monday, 2014

Approximating PageRank locally with sublinear query complexity.

[BibT_eX]

[DOI]

CoRR, 2014

Automated Detection of New or Evolving Melanocytic Lesions Using a 3D Body Model.

[BibT_eX]

[DOI]

Proceedings of the Medical Image Computing and Computer-Assisted Intervention - MICCAI 2014, 2014

The Counterpoint Game: Rules, Constraints and Computational Spaces.

[BibT_eX]

[DOI]

Proceedings of the Music Technology meets Philosophy, 2014

2013

The power of local information in PageRank.

[BibT_eX]

[DOI]

Vincenzo-Maria Cappelleri

Proceedings of the 22nd International World Wide Web Conference, 2013

Simple, Fast, Accurate Melanocytic Lesion Segmentation in 1D Colour Space.

[BibT_eX]

Proceedings of the VISAPP 2013, 2013

Elastic paging.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

Optimal throughput and delay in delay-tolerant networks with ballistic mobility.

[BibT_eX]

[DOI]

Federica Bogo

Proceedings of the 19th Annual International Conference on Mobile Computing and Networking, 2013

2012

HITS Can Converge Slowly, But Not Too Slowly, in Score and Rank.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Psoriasis segmentation through chromatic regions and Geometric Active Contours.

[BibT_eX]

[DOI]

Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2012

2011

<i>psort</i>, yet another fast stable sorting software.

[BibT_eX]

[DOI]

Paolo Bertasi

ACM J. Exp. Algorithmics, 2011

VirtualShave: Automated hair removal from digital dermatoscopic images.

[BibT_eX]

[DOI]

M. Fiorese

Alberto Silletti

Proceedings of the 33rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2011

Datamation: A Quarter of a Century and Four Orders of Magnitude Later.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Cluster Computing (CLUSTER), 2011

2010

Is (N)PRI suitable for evaluating automated segmentation of cutaneous lesions?

[BibT_eX]

[DOI]

Alberto Silletti

Pattern Recognit. Lett., 2010

Choose the damping, choose the ranking?

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Urban Hitchhiking.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

psort, Yet Another Fast Stable Sorting Software.

[BibT_eX]

[DOI]

Paolo Bertasi

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Score and rank convergence of HITS.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2009

Brief announcement: (more) efficient pruning of ad-hoc wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

The rank convergence of HITS can be slow

[BibT_eX]

[DOI]

CoRR, 2008

2007

Huge networks, tiny faulty nodes.

[BibT_eX]

[DOI]

PhD thesis, 2007

2006

Robust network connectivity: when it's the big picture that matters.

[BibT_eX]

[DOI]

Larry Rudolph

Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006

2005

Some Computational Complexity Results for Synchronous Context-Free Grammars.

[BibT_eX]

[DOI]

Giorgio Satta

Proceedings of the HLT/EMNLP 2005, 2005

2004

The Lazy Adversary Conjecture Fails.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

2003

Online paging with arbitrary associativity.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2001

A Characterization of Temporal Locality and Its Portability across Memory Hierarchies.

[BibT_eX]

[DOI]

Gianfranco Bilardi