BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Knot theory and data distribution
DTSTART:20151023T141500
DTEND:20151023T153000
DTSTAMP:20260407T002638Z
UID:e569cd258447c95a158274845a305bb74770078e856898509ca9823b
CATEGORIES:Conferences - Seminars
DESCRIPTION:Adam Eppendahl (Institute of Cybernetics\, Tallinn)\nBack in t
 he nineties\, Bill Roscoe gave a scalable algorithm for passing updates ar
 ound a distributed database and proved that the algorithm maintains databa
 se consistency. The proof goes via an algebraic structure that obeys the r
 ack law used in knot theory. We observe that when the paths of updates are
  drawn in space-time the connection with knot theory stands out clearly. T
 his leads to a simple topological proof of the original algorithm and to e
 xtensions of the algorithm. The applications to concurrency actually sugge
 st a weaker theory of demi-racks\, which may be related to directed homoto
 pies (although I’m not sure about this). Both the knot theory and databa
 se model are very elementary\, so computer scientists should be able to fo
 llow the maths and mathematicians\, the computer science. The interest lie
 s in the simplicity of the topological picture.
LOCATION:GCD0386 http://plan.epfl.ch/?zoom=18&recenter_y=5864132.9226&rece
 nter_x=730703.25619&layerNodes=fonds\,batiments\,labels\,information\,park
 ings_publics\,arrets_metro\,transports_publics&floor=0&q=GCD0386
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR