Publications

(2003). A Note on the Set Systems Used for Broadcast Encryption. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms.
(2002). The Complexity of Solving Equations Over Finite Groups. Information and Computation.
(2002). Quantum Walks on the Hypercube. Proceedings of the 6th International Workshop on Randomization and Approximation Techniques.
(2002). Optimally Work-Competitive Scheduling for Cooperative Computing with Merging Groups. Proceedings of the twenty-first annual symposium on Principles of distributed computing.
(2002). Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. SIAM Journal on Computing.
(2002). Inapproximability Results for Equations over Finite Groups. Proceedings of the 29th International Colloquium on Automata, Languages and Programming.
(2002). How to Fool an Unbounded Adversary with a Short Key. Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques.
(2002). Failure sensitive analysis for parallel algorithm with controlled memory access concurrency. Procedings of the 6th International Conference on Principles of Distributed Systems (OPODIS).
(2001). Perfect Information Leader Election in $łog^* n + O(1)$ Rounds. Journal of Computer and System Sciences.
(2001). The Complexity of Synchronous Iterative Do-All with Crashes. Proceedings of the 15th International Conference on Distributed Computing.