6th International Colloquium on Structural Information and Communication Complexity

[back to the program]

Time Thursday July 1st, 1999 Friday July 2nd, 1999 Saturday July 3rd, 1999

Session 1 : 09:00 - 11:00 Session 1 : 09:00 - 11:00 Session 1 : 10:00 - 11:00

09:00 Invited talk - Maurice Herlihy
Algebraic Topology and Distributed Computing
Invited talk - Ori Gerstel
A practical perspective on optical networks: where is the R&D community heading?

10:00 Irreversible dynamos in butterflies
Fabrizio Luccio, Linda Pagli, Hermineh Sanossian
Gossiping in inclined LEO satellite networks
Peter Gvozdjak, Joseph G. Peters
Compact-port routing models and applications to distance-hereditary graphs
Serafino Cicerone, Gabriele Di Stefano, Michele Flammini

10:30 Monotone dynamos in tori
Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro
Trade-offs for odd gossiping
Guillaume Fertin
Some results on the space requirement of interval routing
Savio S. H. Tse, Francis C. M. Lau

11:00 Coffee Break Coffee Break Coffee Break

Session 2 : 11:30 - 12:30 Session 2 : 11:30 - 12:30 Session 2 : 11:30 - 13:00

11:30 Fault-tolerant wavelength allocations in all-optical hypercubes
Jan Manuch, Ladislav Stacho
Multi-source spanning tree problems
Arthur M. Farley, Paraskevi Fragopoulou, David Krumme, Andrzej Proskurowski, Dana Richards
Augmented ring networks
William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman

12:00 Power and limitations of optical reconfigurable arrays
Jop E. Sibeyn
Dynamic load balancing with group communication
Shlomi Dolev, Roberto Segala, Alex Shvartsman
Triangulations and chordal rings
Lali Barriere

12:30 Lunch Lunch Evolutionary graph colouring
Stefan Dobrev, Heiko Schroder, Ondrej Sykora, Imrich Vrt'o

13:00
Lunch at the hotel - End of the conference

Session 3 : 14:30 - 16:00 Session 3 : 14:30 - 15:30

14:30 Some problems in distributed computational geometry
Sergio Rajsbaum, Jorge Urrutia
Convergence and concentration results for packet routing networks
Suprakash Datta, Ramesh Sitaraman

15:00 Threshold counters with increments and decrements
Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
Rank of graphs: the size of acyclic orientation cover for deadlock-free packet routing
R. Kraloviv, P. Ruzicka

15:30 Searching with uncertainty
Evangelos Kranakis, Danny Krizanc
Social Event:

visit of a castle in the vineyards of Bordeaux
Château Giscours, Margaux

16:00 Coffee Break

Session 4 : 16:30 - 17:30

16:30 Snap-stabilizing PIF algorithm in tree networks without sense of direction
Alain Bui, Ajoy K. Datta, Franck Petit, Vincent Villain

17:00 Leader election using any sense of direction
Stefan Dobrev

19:30 Dinner at the hotel

20:00 Dinner at the hotel

21:00 Open Problems & Rump Session

Time	Thursday July 1st, 1999	Friday July 2nd, 1999	Saturday July 3rd, 1999
Session 1 : 09:00 - 11:00		Session 1 : 09:00 - 11:00	Session 1 : 10:00 - 11:00
09:00	Invited talk - Maurice Herlihy Algebraic Topology and Distributed Computing	Invited talk - Ori Gerstel A practical perspective on optical networks: where is the R&D community heading?
10:00	Irreversible dynamos in butterflies Fabrizio Luccio, Linda Pagli, Hermineh Sanossian	Gossiping in inclined LEO satellite networks Peter Gvozdjak, Joseph G. Peters	Compact-port routing models and applications to distance-hereditary graphs Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
10:30	Monotone dynamos in tori Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro	Trade-offs for odd gossiping Guillaume Fertin	Some results on the space requirement of interval routing Savio S. H. Tse, Francis C. M. Lau
11:00	`Coffee Break`	`Coffee Break`	`Coffee Break`
Session 2 : 11:30 - 12:30		Session 2 : 11:30 - 12:30	Session 2 : 11:30 - 13:00
11:30	Fault-tolerant wavelength allocations in all-optical hypercubes Jan Manuch, Ladislav Stacho	Multi-source spanning tree problems Arthur M. Farley, Paraskevi Fragopoulou, David Krumme, Andrzej Proskurowski, Dana Richards	Augmented ring networks William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
12:00	Power and limitations of optical reconfigurable arrays Jop E. Sibeyn	Dynamic load balancing with group communication Shlomi Dolev, Roberto Segala, Alex Shvartsman	Triangulations and chordal rings Lali Barriere
12:30	`Lunch`	`Lunch`	Evolutionary graph colouring Stefan Dobrev, Heiko Schroder, Ondrej Sykora, Imrich Vrt'o
13:00	`Lunch`	`Lunch`	`Lunch at the hotel - End of the conference`
Session 3 : 14:30 - 16:00		Session 3 : 14:30 - 15:30
14:30	Some problems in distributed computational geometry Sergio Rajsbaum, Jorge Urrutia	Convergence and concentration results for packet routing networks Suprakash Datta, Ramesh Sitaraman
15:00	Threshold counters with increments and decrements Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas	Rank of graphs: the size of acyclic orientation cover for deadlock-free packet routing R. Kraloviv, P. Ruzicka
15:30	Searching with uncertainty Evangelos Kranakis, Danny Krizanc	`Social Event:` `visit of a castle in the vineyards of Bordeaux` `Château Giscours, Margaux`
16:00	`Coffee Break`
Session 4 : 16:30 - 17:30
16:30	Snap-stabilizing PIF algorithm in tree networks without sense of direction Alain Bui, Ajoy K. Datta, Franck Petit, Vincent Villain
17:00	Leader election using any sense of direction Stefan Dobrev
19:30	`Dinner at the hotel`
20:00	`Dinner at the hotel`	`Dinner at the hotel`
21:00	Open Problems & Rump Session	`Dinner at the hotel`