Compressed collections for simulated crawling. - Alessio Orlandi; Sebastiano Vigna (SIGIR Forum, 2008)

More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. - Roberto Grossi; Alessio Orlandi; Rajeev Raman; S. Srinivasa Rao 001 (STACS, 2009)

Fun with Olympiad in Algorithmics. - Roberto Grossi; Alessio Orlandi; Giuseppe Ottaviano (FUN, 2010)

Optimal Trade-Offs for Succinct String Indexes. - Roberto Grossi; Alessio Orlandi; Rajeev Raman (ICALP (1), 2010)

Optimal Trade-Off for Succinct String Indexes - Roberto Grossi; Alessio Orlandi; Rajeev Raman (CoRR, 2010)

Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs. - Donatella Firmani; Giuseppe F. Italiano; Luigi Laura; Alessio Orlandi; Federico Santaroni (SEA, 2012)

Advanced rank/select data structures: succinctness, bounds and applications. - Alessio Orlandi (2012)

Optimal Indexes for Sparse Bit Vectors. - Alexander Golynski; Alessio Orlandi; Rajeev Raman; S. Srinivasa Rao 001 (Algorithmica, 2014)

Thermal BEC Black Holes. - Roberto Casadio; Andrea Giugno; Octavian Micu; Alessio Orlandi (Entropy, 2015)

Space-Efficient Substring Occurrence Estimation. - Alessio Orlandi; Rossano Venturini (Algorithmica, 2016)

Turing Arena Light: Enhancing Programming Education Through Competitive Environments. - Giorgio Audrito; Luigi Laura; Alessio Orlandi; Dario Ostuni; Romeo Rizzi; Luca Versari (From Strings to Graphs, and Back Again, 2025)