Email: firstname dot lastname at gmail dot com
UPDATE: I have graduated! I am currently a post-doc at Princeton Center for Computational Intractability.
I was a PhD candidate in the Computer Science and AI Laboratory at MIT. I was advised by Prof. Nancy Lynch. My research interests include the theory of distributed computing and formal methods in computer science.
Publications
- Rotem Oshman. Distributed Computation in Wireless and Dynamic Networks. PhD Thesis.
- Andrew Drucker, Fabian Kuhn and Rotem Oshman. The Communication Complexity of Task Aggregation. In the 31st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2012).
- Fabian Kuhn and Rotem Oshman. The Complexity of Data Aggregation in Directed Networks. In the 25th International Symposium on DIStributed Computing (DISC 2011).
- Fabian Kuhn, Yoram Moses and Rotem Oshman. Coordinated Consensus in Dynamic Networks. In the 30th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011).
- Thomas Moscibroda and Rotem Oshman. Resilience of Mutual Exclusion Algorithms to Transient Memory Faults. In the 30th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011).
- Fabian Kuhn, Christoph Lenzen, Thomas Locher and Rotem Oshman. Optimal Gradient Clock Synchronization in Dynamic Networks. In the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010).
- Fabian Kuhn, Nancy Lynch, Calvin Newport, Rotem Oshman and Andrea Richa. Broadcasting in Unreliable Networks. In the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010).
- Fabian Kuhn, Nancy Lynch, Rotem Oshman. Distributed Computation in Dynamic Graphs. In the 42nd ACM Symposium on Theory of Computing (STOC 2010).
- Fabian Kuhn, Rotem Oshman. Gradient Clock Synchronization Using Reference Broadcasts. In the 13th International Conference Principles of Distributed Systems (OPODIS 2009).
- Fabian Kuhn, Thomas Locher, Rotem Oshman. Gradient Clock Synchronization in Dynamic Networks. In the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2009).
- Rotem Oshman. An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking. In the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2009).
- Rotem Oshman, Orna Grumberg. A New Approach to Bounded Model Checking for Branching Time Logics. In the 5th International Symposium on Automated Technology for Verification and Analysis.