Colloquia and Seminars

To join the email distribution list of the cs colloquia, please visit the list subscription page.

Upcoming Colloquia & Seminars

  • ceClub: Adopting Software-Defined Networking: Challenges and Recent Developments

    Speaker:
    Kirill Kogan (IMDEA Networks Institute)
    Date:
    Wednesday, 1.7.2015, 11:30
    Place:
    EE Meyer Building 1061

    Initially, SDN has been promoted as a simpler and more flexible way of managing networks than traditional approaches. However, it is unlikely that a single SDN controller vendor will have best-in-class implementation of all network services, so the coexistence of several managing controllers will be a mandatory feature of SDN network management in the near future. Similarly, there is a price for generality and expressiveness to be paid with efficiency of the data plane representations. We consider challenges from the above domains and emphasize the importance of new abstractions for both control and data planes to address heterogeneity of manageable network state.

    Bio:
    Kirill Kogan is currently a Research Assistant Professor at IMDEA Networks Institute. His research interests are related to admission control and buffer management, packet classification, software-defined networking, network functions visualization. Prior to joining IMDEA Networks Institute he worked as a Technical Leader at Cisco Systems and later a postdoctoral researcher at University of Waterloo and Purdue University. He holds a PhD in CSE from Ben-Gurion University.

  • Theory Seminar: Sampling in Space Restricted Settings

    Speaker:
    Anup Bhattacharya (IIT Delhi)
    Date:
    Wednesday, 1.7.2015, 12:30
    Place:
    Taub 201

    We consider the random sampling problem in the streaming setting. The algorithm returns, at any time t, an item chosen uniformly at random from all items seen till time t. Our model allows storage for only one item at a time in the stream. We design an algorithm that takes O(log n) random bits and O(log n) space to maintain a random sample at all times. Our algorithm in the streaming setting matches the lower bound on the amount of required randomness for uniform sampling in the offline setting.

    We also extend the work on sampling in the query model by Bringmann and Larsen (STOC 2013) to the approximate setting and obtain almost matching upper and lower bounds for the problem.

    Joint work with: Davis Issac, Ragesh Jaiswal and Amit Kumar