Skip to content.
|
Skip to navigation
Site Map
Accessibility
Contact
Search Site
only in current section
Advanced Search…
Personal tools
Log in
Navigation
News
Events
Graduate Study
People
Local Information
Research
Contact
LFCS seminar: Mayank Goswami:Distance sensitive Bloom filters without false negatives
Title: Mobile $r$-gather: Distributed and Geographic Clustering for Location Anonymity
Title: MCMix: Anonymous Messaging via Secure Multiparty Computation
Title: The geometry of Boolean algebra
Title: Test Case Permutation to Improve Execution Time
You are here:
Home
→
Events
→
Algorithms & Complexity Group Meetings
→
Upcoming Algorithms and Complexity Reading Group Meetings
Info
Upcoming Algorithms and Complexity Reading Group Meetings
There are currently no items in this folder.
Document Actions
RSS feed
Print this
Upcoming Events
LFCS seminar: Guillem Perarnau: Rapid mixing of Glauber dynamics for graph colorings
IF 4.31/4.33,
Sep 25, 2018
LFCS seminar: Matthew Jenssen
Oct 09, 2018
LFCS seminar: Carl Hewitt
IF 4.31/4.33,
Nov 13, 2018
Previous events…
Upcoming events…
News
Best Paper Award at ICALP'18
Sep 03, 2018
Congratulations to Ricardo Almeida on successfully passing his VIVA
Aug 08, 2017
Congratulations to Perdita Stevens who has received a prestigious award (10-year most influential paper, from the MODELS conference)
Mar 06, 2017
Congratulations to Cheng Feng on successfully passing his VIVA
Nov 14, 2016
Multiple open permanent faculty positions in Algorithms and Complexity at the University of Edinburgh, School of Informatics
Nov 14, 2016
More news…
Powered by Plone
Valid XHTML
Valid CSS
Section 508
WCAG
Best Paper Award at ICALP'18