Geometric, Approximation & Distributed Algorithms
A Computer Science Theory Lab at the University of Manitoba

About

 
Welcome to the GADA lab at the University of Manitoba! We study algorithms and the complexity of problems from a wide variety of research domains, such as computational geometry, approximation algorithms, online algorithms, and distributed algorithms. The common theme to all of our activities is the rich interplay between interesting problems from Computer Science and the techniques and rigour of Mathematics. Our weekly meetings alternate between problem-solving sessions and research talks, and anyone can join us! Explore this page to find out more.

Recent News



  • Welcome to the Lab

    Welcome to Sachini Rajapakse who is joining the GADA Lab as a new M.Sc. student in September 2020

  • Best Student Paper Award

    Congratulations to Md. Yeakub Hassan and Ullash Saha on being awarded Best Student Paper at the IEEE International Conference on Cloud and Big Data Computing (CBDCom 2020)!

  • Ullash Saha, M.Sc.

    Congratulations to Ullash Saha on successfully defending his M.Sc. thesis!

  • Md. Yeakub Hassan, M.Sc.

    Congratulations to Md. Yeakub Hassan on successfully defending his M.Sc. thesis!

  • January 15, 2020: Talk by Kenny Zhang

    Kenny will be giving a talk titled "Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs"

Faculty

Stephane Durocher

Professor
Home page

Avery Miller

Assistant Professor
Home page

Shahin Kamali

Assistant Professor
Home page

Members


Current

Arezoo Sajadpour
Dehou Zhang
Kimia Shadkami
Masood Shabani
Pooya Nikbakht
Sachini Rajapakse
Saulo dos Santos
Yeakub Hassan
Yongzhen Ren
Former

Colin Krisko
Dalin Chen
Debajyoti Mondal
Derek Cormier
Fengyi Liu
Francisco de la Rosa
Garrett Suss
Ishan Chopra
Ivan Chernavtcev
Janani Sundaresan
Joe Vermander
Joshua Hernandez
Kelly Ramsay
Kenny Zhang
Kyle Joseph
Lyndon Miller
Matthew Skala
Mohammad Abdul Wahid
Nima Sheibani
Robby Singh
Robert Fraser
Saeed Mehrabi
Sahar Mehrpour
Sameer Naib
Sean Egan
Timothy Zapp
Tristan Ratchford
Ullash Saha
Yeganeh Bahoo

Projects

Click on a project for more information

Recent Publications (2020/2021)

Click here for all publications

Title Authors Venue Links
Beyond Worst-case Analysis of Multicore Caching StrategiesShahin Kamali
Helen Xu
CoRRPublication Link
Burning Two WorldsShahin Kamali
Avery Miller
Kenny Zhang
SOFSEMPublication Link
Candidate Set Formation Policy for Mining PoolsShahin Kamali
Saulo dos Santos
Ruppa K. Thulasiram
BlockchainPublication Link
Clustering Moving Entities in Euclidean SpaceStephane Durocher
Md Yeakub Hassan
SWATPublication Link
Compact Representation of Graphs with Small Bandwidth and TreedepthShahin Kamali
DCCPublication Link
Computing the k-Visibility Region of a Point in a PolygonYeganeh Bahoo
Prosenjit Bose
Stephane Durocher
Thomas C. Shermer
Theory Comput. Syst.Publication Link
Contract Scheduling With PredictionsSpyros Angelopoulos
Shahin Kamali
CoRRPublication Link
Cutting Stock with Rotation: Packing Square Items into Square BinsShahin Kamali
Pooya Nikbakht
COCOAPublication Link
Deterministic Leader Election in Anonymous Radio NetworksAvery Miller
Andrzej Pelc
Ram Narayan Yadav
SPAAPublication Link
Deterministic Leader Election in Anonymous Radio NetworksAvery Miller
Andrzej Pelc
Ram Narayan Yadav
CoRRPublication Link
Efficient Privacy-Preserving Approaches for Trajectory DatasetsStephane Durocher
Md Yeakub Hassan
Avery Miller
Noman Mohammed
Ullash Saha
DASC/PiCom/CBDCom/CyberSciTechPublication Link
Fast Byzantine Gathering with Visibility in GraphsAvery Miller
Ullash Saha
CoRRPublication Link
Fast Byzantine Gathering with Visibility in GraphsAvery Miller
Ullash Saha
ALGOSENSORSPublication Link
ForewordStephane Durocher
Shahin Kamali
Comput. Geom.Publication Link
Four Shades of Deterministic Leader Election in Anonymous NetworksBarun Gorain
Avery Miller
Andrzej Pelc
CoRRPublication Link
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access ChannelKokouvi Hounkanli
Avery Miller
Andrzej Pelc
Theor. Comput. Sci.Publication Link
Local Routing in Convex SubdivisionsProsenjit Bose
Stephane Durocher
Debajyoti Mondal
Maxime Peabody
Matthew Skala
Mohammad Abdul Wahid
Int. J. Comput. Geom. Appl.Publication Link
Multicore Paging Algorithms Cannot Be CompetitiveShahin Kamali
Helen Xu
SPAAPublication Link
On the Restricted 1-Steiner Tree ProblemProsenjit Bose
COCOONPublication Link
Online Computation with Untrusted AdviceSpyros Angelopoulos
Christoph Dürr
Shendan Jin
Shahin Kamali
Marc P. Renault
ITCSPublication Link
Randomized Two-Valued Bounded Delay Online Buffer ManagementChristoph Dürr
Shahin Kamali
CoRRPublication Link
Robustness and asymptotics of the projection medianStephane Durocher
Alexandre Leblanc
Kelly Ramsay
J. Multivar. Anal.Publication Link

Join The Lab

 

If you are currently a student or faculty member at the University of Manitoba, send an e-mail to one of our lab's faculty members to find out how to join our mailing list and attend our lab meetings.

We have funding available to provide financial support for highly motivated and qualified graduate students interested in pursuing a M.Sc. or Ph.D. degree. We also welcome visitors that wish to participate in our lab's research projects. If you are interested in the above opportunities, send an e-mail to one of our lab's faculty members, and include the following:

  • Confirmation that you have read this web page
  • A brief description of topics or specific research problems in theoretical computer science that interest you (these could be, but need not be restricted to, topics related to our lab's current research)
  • An overview of any research experience you have (e.g., a research internship, a course project related to your research interests, your undergraduate thesis, or graduate courses taken)
  • Your curriculum vitae, including degrees obtained and their corresponding institutions, and a list of any academic awards, scholarships, or bursaries received
  • Your grade point average and, if available, an electronic (or scanned) copy of your transcripts
  • A list of senior courses you took in theoretical computer science and mathematics
  • A list of your publications (if any)
  • Contact information for at least two references (email and telephone)