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
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: Andreas Galanis: Inapproximability of the independent set polynomial in the complex plane
IF 4.31/4.33,
Apr 24, 2018
LFCS seminar: Alessandro Abate: Formal verification of complex systems: model-based and data-driven methods
IF 4.31/4.33,
May 01, 2018
LFCS seminar: Varun Kanade
IF 4.31/4.33,
May 08, 2018
LFCS seminar: Mihai Cucuringu
IF 4.31/4.33,
May 22, 2018
Swift Logic for Big Data and Knowledge Graphs
Lecture Theatre 4, Appleton Tower,
Jun 27, 2018
Previous events…
Upcoming events…
News
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
Congratulations to Anastasis Georgoulas who successfully passed his VIVA
Sep 13, 2016
More news…
Powered by Plone
Valid XHTML
Valid CSS
Section 508
WCAG