 |
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 Luca Becchetti or Irene Finocchi.
|
[an error occurred while processing this directive]
|
Season 2008-09
Monday,
May 4th, 2009, 12:00 noon
Abstract
Compression and
caching for efficient web retrieval
Flavio Chierichetti, "Sapienza" - University of Rome
DIS
- Department of
Computer Engineering,
Via Ariosto 25
Room
B1, ground floor
Monday,
April 20th, 2009, 12:00 noon
Abstract
Affiliation Networks
Silvio Lattanzi, "Sapienza" - University of Rome
DIS
- Department of
Computer Engineering,
Via Ariosto 25
Room
B1, ground floor
Monday,
April 6th, 2009, 12:00 noon
Abstract
Isomorphism theorems
for even cycles and even cuts in graphs
Bertrand Guenin, University of Waterloo, Ontario
DI
- Department of
Computer Science, Via Salaria 113
Seminar
room, third floor
Monday,
March 30th, 2009, 12:00 noon
Abstract
Near-Optimal Dynamic
Replication in Unstructured Peer-to-Peer Networks
Mauro Sozio, Max
Planck Institut fuer Informatik
DI
- Department of
Computer Science, Via Salaria 113
Seminar
room, third floor
Monday,
March 23rd, 2009, 12:00 noon
Abstract
Approximability of
Pricing Problems
Piotr Krysta,
Liverpool University
DIS
- Department of
Computer Engineering,
Via Ariosto 25
Room
B1, ground floor
Monday,
March 16th, 2009, 12:00 noon
Abstract
Justice, Truth and
Makespan
Amos Fiat, Tel Aviv
University
DIS
- Department of
Computer Engineering,
Via Ariosto 25
Room
B1, ground floor
Monday,
March 2nd, 2009, 12:00 noon
Abstract
On the design of
robust, large-scale networks
Jared Saia,
University of New Mexico
DIS
- Department of
Computer Engineering,
Via Ariosto 25
Room
B1, ground floor
Monday,
February 23rd, 2009, 12:00 noon
Abstract
Non-Malleable
Extractors and Symmetric Key Cryptography from Weak Secrets
Daniel Wichs, New
York University
DI
- Department of
Computer Science, Via Salaria 113
Aula
Alfa, ground floor
Monday,
February 2nd, 2009, 12:00 noon
Abstract
Approximating
Crossing Spanning Trees -- Using Cut Structure to Refine Iterative
Rounding
Jochen Koenemann,
University of Waterloo, Ontario
DIS
- Department of
Computer Engineering,
Via Ariosto 25
Aula
"Marco Cadoli" (ex B2), ground floor
Monday,
November 10, 2008, 12:00 noon Abstract
Navigability
Emergence in Social Networks
Pierre
Fraigniaud, CNRS and University Paris Diderot
DIS
- Department of
Computer Engineering,
Via Ariosto 25
Aula
Magna, first floor
Monday,
October 27, 2008, 12:00 noon Abstract
Flooding Time in
Edge-Markovian Dynamic Graphs
Andrea
Clementi, Università di Tor Vergata
DIS
- Department of
Computer Engineering,
Via Ariosto 25
Aula
Magna, first floor
Maintained
by Luca Becchetti