Laura Poplawski

ljp [at] ccs [dot] neu [dot] edu
Office: 266 West Village H

I'm a computer science PhD student at Northeastern University, currently on educational leave of absense from IBM Global Services (Boston Center for IBM e-business Innovation).

Research interests: Online Algorithms, Approximation Algorithms, game theory

Advisor: Rajmohan Rajaraman

Publications and Patents

  • Nikolaos Laoutaris, Laura Poplawski, Rajmohan Rajaraman, Ravi Sundaram, and Shang-Hua Teng. Bounded Budget Connection (BBC) games or How to make friends and influence people, on a budget. accepted to ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) 2008.
  • Aaron Cote, Adam Meyerson, and Laura Poplawski. Randomized K-Server on Hierarchical Binary Trees. ACM Symposium on Theory of Computing (STOC) 2008.
  • Adam Meyerson, Akash Nanavati, and Laura Poplawski. Randomized Online Algorithms for Minimum Metric Bipartite Matching . ACM-SIAM Symposium on Discrete Algorithms (SODA) 2006.
  • US Patent 7,194,402 B2 (with IBM Global Services), Method and System for Converting Files to a Specified Markup Language, March 20, 2007.

Educational Background

Graduate Coursework

(* = not for credit)

Employment History

Hobbies and Interests

Duplicate bridge, quilting, piano, skiing, hiking

and one advertisement...

My older sister is trying to sell this house in Randolph, Vermont. I can put you in touch with her if you're interested.