SIA:
S
eminario 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 Luca Becchetti or Irene Finocchi.

[an error occurred while processing this directive]




Season 2006-07

Monday, July 2, 2007, 12:00 noon Abstract
Few Distance sets
Zoltan Furedi, University of Illinois at Urbana-Champaign and Renyi Institute of Mathematics, Hungarian Academy of Sciences

DI - Department of Computer Science, Via Salaria 113
Seminar Room, third floor



Monday, June 25, 2007, 12:00 noon Abstract
Rank Complexity Gap for Lovasz-Schrijver ans Sherali-Adams Proof Systems
Stefan Dantchev, University of Durham

DI - Department of Computer Science, Via Salaria 113
Seminar Room, third floor



Monday, May 28, 2007, 12:00 noon Abstract
Montecarlo Markov chains in Statistical Physics and Combinatorial Structures

Fabio Martinelli, University of Roma Tre

DI - Department of Computer Science, Via Salaria 113
Seminar Room, third floor



Monday, May 7, 2007, 12:00 noon Abstract

Monotony and Surprise: Conservative Approaches to Pattern Discovery
Alberto Apostolico, Accademia Nazionale dei Lincei & Georgia Tech

DIS - Department of Computer Enigeering, Via Salaria 113
Room C3, second floor



Monday, April 30, 2007, 12:00 noon Abstract
SAF: a Similarity-based Adaptable Framework based on Time Series Forecasting Techniques

Daniela Tulone, CSAIL MIT

DI - Department of Computer Science, Via Salaria 113
Seminar Room, third floor



Monday, April 16, 2007, 12:00 noon Abstract
NP search problems for low fragments of bounded arithmetic

Alan Skelley, University of Toronto and University of Rome "La Sapienza"

DI - Department of Computer Science, Via Salaria 113
Seminar Room, third floor



Monday, April 2, 2007, 12:00 noon Abstract
Small stretch (alpha, beta) - spanners in the streaming model

Paolo Franciosa, Dipartimento di Statistica, Probabilita' e Statistice Applicate, University of Rome "La Sapienza"

DI - Department of Computer Science, Via Salaria 113
Seminar Room, third floor



Monday, March 19, 2007, 12:00 noon Abstract
Oblivious Network Design

Anupam Gupta, Carnegie Mellon University

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



Monday, March 5, 2007, 12:00 noon Abstract
Online Integer Packing

Naveen Garg, Indian Institute of Technology & MPI-Informatik

DI - Department of Computer Science, Via Salaria 113
Seminar Room, third floor



Monday, February 19, 2007, 12:00 noon Abstract
A Routing Protocol with Selective Forwarding for Mobile Ad-Hoc Networks

D. Manivannan, Department of Computer Science, University of Kentucky


DI
-
Via Salaria 113
Porch Room,
ground floor



Monday, February 12, 2007, 12:00 noon Abstract
Efficient Cost-Sharing Mechanisms for Prize-Collecting Steiner Forest

Stefano Leonardi, Dipartimento di Informatica e Sistemistica, Universita' "La Sapienza"


DI
-
Via Salaria 113
Alfa Room,
ground floor



Monday, January 29, 2007, 12:00 noon Abstract
Computing Equilibria

Christos Papadimitriou, University of California, Berkeley

DI - Department of Computer Science
Seminar Room, third floor



Monday, December 18, 2006, 12:00 noon Abstract
Communication in Dynamic Radio Networks

Andrea Clementi, University of Rome "Tor Vergata"

DI - Department of Computer Science
Seminar Room, third floor



Monday, December 4, 2006, 12:00 noon Abstract
Energy Conservation in Multi-hop Wireless Networks

Robin Kravets, University of Illinois, Urbana-Champaign

DI - Department of Computer Science
Seminar Room, third floor



Monday, November 27, 2006, 12:00 noon Abstract
A Faster Cache-Oblivious Shortest-Path Algorithm for Undirected Graphs with Bounded Edge Length

Luca Allulli, University of Rome "La Sapienza"

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



Monday, November 13, 2006, 12:00 noon Abstract
Efficient and Decentralized PageRank Approximation in a Peer-to-Peer Web Search Network

Debora Donato, Yahoo Research, Barcelona

DI - Department of Computer Science
Seminar Room, third floor



Monday, November 6, 2006, 12:00 noon Abstract
On line algorithms, real time, the virtue of laziness and the power of claivoyance

Giorgio Ausiello, University of Rome "La Sapienza"

DI - Department of Computer Science
Seminar Room, third floor



Monday, October 16, 2006, 12:00 noon Abstract
Dynamic Graph Algorithms

Piotr Sankowski, University of Rome "La Sapienza"

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



Monday, October 9, 2006, 12:00 noon Abstract
Algorithms for Data Management and Migration

Samir Khuller, University of Maryland

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




Maintained by Irene Finocchi