SIA:
Seminario Interdipartimentale di Algoritmica
Interdepartmental Seminar on Algorithmics

This is a joint cycle of seminars of the Department of Computer and System Sciences (DIS) and of the Department of Computer Science (DI) of the University of Rome "La Sapienza". The seminars are devoted to the study of algorithms in a general sense. In addition to the classical theoretical and experimental aspects of algorithmics, a broad spectrum of topics is considered, including computational complexity, engineering and applications, operations research, and discrete mathematics. The seminars are open to every discipline in which algorithmics finds an application.

Being a joint event, the seminars take place either at DIS, or at DI, usually on monday at 12:00 noon.

For information about the seminar, please contact Camil Demetrescu or Alessandro Mei.

[an error occurred while processing this directive]

Season 2005-06

Monday, June 26, 2006, 12:00 noon Abstract
Implicit Computational Complexity - Some New (and Old) Results
Ugo Dal Lago, Università di Verona

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, June 19, 2006, 12:00 noon Abstract
Hunting for Snakes in Hypercubes
Anil M. Shende, Roanoke College, USA

DI - Department of Computer Science
Seminar Room, third floor

Monday, June 12, 2006, 12:00 noon Abstract
Algorithms for Link-Based Web Spam Detection
Carlos Castillo, University of Rome "La Sapienza"

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, June 5, 2006, 12:00 noon Abstract
Mobility in Sensor Networks
Tom La Porta, Penn State University

DI - Department of Computer Science
Seminar Room, third floor

Monday, May 15, 2006, 12:00 noon Abstract
Forward-Security in the Limited Communication Model
Stefan Dziembowski, ETH Zurich

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, May 8, 2006, 12:00 noon Abstract
Web Dragons: Inside the Myths of Search Engines
Marco Gori, Università di Siena

DI - Department of Computer Science
Seminar Room, third floor

Monday, April 10, 2006, 12:00 noon Abstract
Lower Stretch Spanning Trees
Michael Elkin, Ben-Gurion University

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, April 3, 2006, 12:00 noon Abstract
On the Solution-Space Geometry of Random Constraint Satisfaction Problems
Federico Ricci Tersenghi, Dip. di Fisica, Università di Roma "La Sapienza"

DI - Department of Computer Science
Seminar Room, third floor

Monday, March 27, 2006, 12:00 noon Abstract
Derandomization: New Results and Applications
Emanuele Viola, Harvard University

DI - Department of Computer Science
Seminar Room, third floor

Monday, March 20, 2006, 12:00 noon Abstract
Reach for A*: an Efficient Point-to-Point Shortest Path Algorithm
Andrew Goldberg, Microsoft Research

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, March 13, 2006, 12:00 noon Abstract
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
Burkhard Monien, University of Paderborn

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, March 6, 2006, 12:00 noon Abstract
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
Amos Fiat, School of Computer Science, Tel Aviv University

DI - Department of Computer Science
Seminar Room, third floor

Monday, February 13, 2006, 12:00 noon Abstract
The Antibandwidth Problem
Imrich Vrto, Institute of Mathematics, Slovak Academy of Sciences

DI - Department of Computer Science
Seminar Room, third floor

Monday, February 6, 2006, 12:00 noon Abstract
Gowers Uniformity, influence of variables, and PCPs
Alex Samorodnitsky, The Hebrew University of Jerusalem

DI - Department of Computer Science
Seminar Room, third floor

Monday, January 16, 2006, 12:00 noon Abstract
Research Issues in Data Summarization and Approximate Query Answering: Efficiency, Accuracy, Privacy Preservation, Sensor Data Streams
Domenico Saccà, Università della Calabria

DI - Department of Computer Science
Seminar Room, third floor

Monday, December 19, 2005, 12:00 noon Abstract
Ranking Word Senses with the HITS Algorithm: Word Sense Disambiguation Meets Link Analysis
Roberto Navigli, Università di Roma "La Sapienza"

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, December 5, 2005, 12:00 noon Abstract
Complexity and Approximation of Some Weighted Coloring Problems
Bruno Escoffier, Université Paris Dauphine

DI - Department of Computer Science
Seminar Room, third floor

Monday, November 28, 2005, 12:00 noon Abstract
Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis
Alain Barrat, Université de Paris-Sud

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, November 21, 2005, 12:00 noon Abstract
Dimension-Reductions in The Hamming Cube and its Applications
Rafail Ostrovsky, UCLA

DI - Department of Computer Science
Seminar Room, third floor

Monday, November 7, 2005, 12:00 noon Abstract
Radio Coloring Problems
Richard B. Tan, Utrecht University

DIS - Department of Computer and System Sciences
Room C3, second floor

Monday, October 24, 2005, 12:00 noon Abstract
Wavelength Conversion in All-Optical Networks
Stamatis Stefanakos, Università di Roma "La Sapienza"

DI - Department of Computer Science
Seminar Room, third floor

Monday, October 17, 2005, 12:00 noon Abstract
Efficient Sorting and Adaptive Sorting with Respect to Branch Mispredictions
Gabriel Moruz, University of Aarhus

DIS - Department of Computer and System Sciences
C3 Room, second floor

Monday, October 3, 2005, 12:00 noon Abstract
Quantum Information Theory and Applications to Classical Computer Science
Iordanis Kerenidis, MIT

DIS - Department of Computer and System Sciences
C3 Room, second floor

Monday, September 26, 2005, 12:00 noon Abstract
Online Scheduling with Bounded Migration
Martin Skutella, University of Dortmund

DIS - Department of Computer and System Sciences
C3 Room, second floor

Maintained by Camil Demetrescu