Curriculum Vita Yonatan Aumann

Personal
Born: 1962 in Jerusalem, Israel.
Citizenship: USA, Israel.
Contacts
Home phone: 02 – 672 6546
Cell phone: 052 - 5655537
Email: aumann@cs.biu.ac.il
Education
Curriculum Vita
Yonatan Aumann
1994 - Ph.D. in Computer Science, from the Hebrew University of Jerusalem.
Advisor: Prof. Michael O. Rabin.
1988 - B.Sc. in mathematics and computer science, summa cum laude, from the Hebrew University
of Jerusalem, Jerusalem, Israel.
Work Experience
1995-Current: Senior Lecturer at Bar-Ilan University, department of Computer Science
1998: Co-founder of ClearForest Ltd., a company specializing in text mining
1994-1995: Visiting scientist at Harvard University, Aiken Computation Laboratory
1993-1994: Post doctorate at MIT laboratory of Computer Science
1992-1993: Fellow. The Weizmann Institute of Science, Rehovot, Israel
Consulting for IBM Research, New York University, Peregrine Ventures
Fellowships and Grants
1992: Wolf Prize for Doctoral Students.
1993: Eshkol Fellowship for Post-doctoral studies.
1994: Wolfson Fellowship for Post-doctoral studies.
2005-2008: Ministry of Science Grant: “Privacy Preserving Data Mining”. Total grant amount:
1,900,000 NIS.
1999-2001: Ministry of Science Grant: “An Integrated System for Knowledge Extraction and
Discovery from Digital Libraries, Electronic Databases, and the World-Wide-Web”. Total grant
amount: $538,000.
1996-1998: Ministry of Science Grant: “Knowledge Discovery in Medical and Hospital Databases: A
Generic Environment, High Level Language and Algorithmic Platform”. Total grant amount -
$730,000.

Graduate Students:
Past:
Moshe Lewenstein.
Yehuda Lindel.
Avivit Kapach-Levi.
Efrat Manistreski.
Demintry Pogrebinsky.
Yaniv Ben Yehuda.
Oren Malmud
Current:
Michal Devir
Boris Glimcher
Aliyahu Tzuk
Areas of Research
Algorithms
Parallel and Distributed Computing
Cryptography
Data and Text Mining
Computational Biology
Courses Taught
Undergraduate:
Automata and formal languages
Computability
Graduate:
Advanced algorithms
Randomized algorithms
Cryptography
Communication complexity
Kolmogorov complexity
Parameterized complexity

Publications
Journal Publications:
1. Y. Aumann and A. Schuster. “Improved Memory Utilization in deterministic PRAM Simulation”.
Journal of Parallel and Distributed Computing, Special Issue on Shared Memory Multi-
Processors. 12(2), 146-151, July 1991. Invited paper.
-Initial version appeared in Proceedings of the Third Symposium on the Frontiers of Massively
Parallel Computation, October 1990, pages: 22-29.
2. Y. Aumann and H. Parnas. “Evaluation of the Time Course of Neurotransmitter Release from the
Measured PSC and MPSC”. Bulletin of Mathematical Biology, 53(4) 537-555, 1991.
3. Y. Aumann and M. O. Rabin. “Clock Construction in Fully Asynchronous Parallel Systems and
PRAM Simulation”. Theoretical Computer Science, 128, 3-30, 1994.
- Initial version appeared in Proceedings of the 33rd Annual Symposium, on the Foundations of
Computer Science (FOCS), 1992, pages: 147-156.
4. Y. Aumann, M. Bender and Y.L. Zhang. “Efficient Execution of Nondeterministic Parallel
Programs on Asynchronous Systems”. Information and Computation, 139(1), 1-16, November
1997.
- Initial version appeared in Proceedings of the 8th Annual ACM Symposium on Parallel
Algorithms and Architectures (SPAA), 1996, pages: 270-276.
5. Y. Aumann and Y. Rabani. “An O(log k) Approximate Min-cut Max-flow Theorem and
Approximation Algorithm for Multi-Commodity Flows”. SIAM Journal of Computing (SICOMP),
27(1), 291-301, February 1998.
6. Y. Aumann, R. Feldman, O. Lipshtat, and H. Manilla. “Borders: an Efficient Algorithm for
Association Generation in Dynamic Databases”. Journal of Intelligent Information System (JIIS),
12:61-73, 1999.
7. Y. Aumann, Y. Bar-Ilan and U. Feige. “On the Cost of Recomputing: Tight Bounds on pebbling
with Faults”. Theoretical Computer Science, 233, 247-261, 2000.
- Initial version appeared in Proceedings of the 21st International Colloquium on Automata,
Languages, and Programming (ICALP), Springer-Verlag, 1994, pages: 47-58.
8. A. Amir, Y. Aumann, G.M. Landau, M. Lewenstein, N. Lewenstein. “Pattern Matching with
Swaps”. Journal of Algorithms 37, 247-266, 2000.
- Initial version appeared in Proceedings of the 36th Annual Symposium, on the Foundations of
Computer Science (FOCS), 1997, pages 144-153.
9. Y. Aumann, J. Hastaad, M.O. Rabin and M. Sudan. “Linear Consistency Testing”. Journal of
Computer and System Sciences (JSSS) 62 (4), 589-607, July 2001.
- Initial version appeared in Proceedings of the 2nd International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (RANDOM 99), LNCS vol. 1671, pages
109-120, 1999.
10. Y. Aumann, Y. Z. Ding and M.O. Rabin. “Everlasting Security in the Bounded Storage Model”.
IEEE Transactions of Information Theory, 48:1668-1680, 2002. Invited paper.
- Initial version appeared as: Y. Aumann and M.O. Rabin. “Information Theoretically Secure
Communication in the Limited Storage Space Model”. In Advances in Cryptology (CRYPTO),
LNCS vol. 1666, pages 65-79, 1999.

11. Y. Aumann and Y. Lindell. “A Statistical Theory of Quantitative Association Rules”. Journal of
Intelligent Information Systems (JIIS), 20 (3):255--283, 2003.
- Initial version appeared in Proceedings of the annual SIGKDD symposium on Data Mining
(KDD), pages 261-270, 1999.
12. Y. Aumann and M. Bender. “Efficient Low-Contention Asynchronous Consensus with the Value-
Oblivious Adversary Scheduler”. Distributed Computing, 17(3):191-207, March 2005.
- Initial version appeared in Proceedings of the 23rd International Colloquium on Automata,
Languages, and Programming (ICALP), Springer-Verlag, 1996, pages: 622-633.
13. Y. Aumann, E. Manisterski and Z. Yakhini. “Designing Optimally Multiplexed SNP Genotyping
Assays”. Journal of Computer and System Sciences (JCSS) special issue on Bioinformatics,
70(3), 399-417, May 2005. Invited paper.
- Initial version appeared in Proceedings of the Workshop on Algorithms in Bioinformatics
(WABI), 2003. Pages 320-338.
14. A. Amir, Y. Aumann, R. Feldman and M. Fresko. “Maximal Association Rules: a Tool for Mining
Associations in Text”. Journal of Intelligent Information Systems (JIIS), 25(3), 333-345,
November 2005.
- Initial version appeared in Proceedings of the the 3rd Annual Conference of Knowledge
Discovery and Data Mining, (KDD '97), 1997, pages 167-170.
15. Y. Aumann, R. Feldman, Y. Liberzon, B. Rosenfeld and J. Schler. “Visual Information
Extraction”. Accepted to Knowledge and Information Systems (KAIS).
16. A. Amir, Y. Aumann, M. Lewenstein, and E. Porat. “Function Matching”. Accepted to SIAM
Journal of Computing (SICOMP).
- Later version appeared as: A. Amir, Y. Aumann, R. Cole, M. Lewenstein, and E. Porat.
“Function Matching: Algorithms, Applications and a Lower Bound”. In Proceedings of the 30 th
International Colloquium on Automata, Languages and Programming, (ICALP), pages 929-942,
2003.
17. D. Lipson, Y. Aumann, A. Ben-Dor, N. Linial and Z. Yakhini. “Efficient Calculation of Interval
Scores for DNA Copy Number”. Accepted to Journal of Computational Biology (JCB).
- Initial version appeared in Proceedings of the 9 th Annual International Conference on Research
in Computational Molecular Biology (RECOMB), pages 83-100, 2005.
18. Y. Aumann and Y. Rabani. “The Minimal Number of Wavelengths Necessary for Routing
Permutations in All Optical Networks”. Accepted to Information Processing Letters.
In Proceedings of Refereed Conferences (and no journal version):
19. Y. Aumann and M. Ben-Or. “Asymptotically Optimal PRAM Emulation on Faulty Hypercubes”, In
Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science (FOCS),
1991, pages: 440-446.
20. Y. Aumann and M. Ben-Or. “Computing with Faulty arrays”, In Proceedings of the 24th Annual
ACM Symposium on Theory of Computing (STOC), 1992, pages: 162-169.

21. Y. Aumann and U. Feige. “One Message Proof Systems with Known Space Verifies”, In
Proceedings of Crypto '93 (CRYPTO), Springer-Verlag, 1993, pages: 85-99.
22. Y. Aumann, K. Palem, Z. Kedem and M. O. Rabin. “Highly Efficient Asynchronous Execution of
Large Grained Parallel Programs”, In Proceedings of the 34th Annual Symposium on the
Foundations of Computer Science (FOCS), November 1993, pages: 271-280.
23. Y. Aumann and Y. Rabani. “Improved Bounds for All Optical Routing”. In Proceedings of 6th
Annual ACM-SIAM Symposium of Discrete Algorithms (SODA), 1995, pages: 567-576.
24. Y. Aumann and M. Bender. “Fault-Tolerant Data Structures”. In Proceedings of the 37th Annual
Symposium, on the Foundations of Computer Science (FOCS), 1996, pages: 580-589.
25. R. Feldman, Y. Aumann, A. Amir, and H. Mannila. “Efficient Algorithms for Discovering Frequent
Sets in Incremental Databases”, In Proceedings of SIGMOD '97 workshop on Data Mining, May,
1997. Pages 159-66.
26. Y. Aumann. “Efficient Asynchronous Consensus with the Weak Adversary Scheduler”. In
Proceedings of 16th Annual ACM Symposium on Principles of Distributed Computing (PODC),
1997. Pages 209-218.
27. Y. Aumann and M.O. Rabin. “Authentication, Enhanced Security and Error Correcting Codes”, In
Advances in Cryptology (CRYPTO), LNCS vol. 1462, pages 299-303, 1998
28. D. Landau, R. Feldman, Y. Aumann, M. Fresko, Y. Lindell, O. Lipshtat, and O. Zamir, “Text-Vis:
An Integrated Visual Environment for Text Mining.” In Principles of Data Mining and Knowledge
Discovery (PKDD), LNCS vol. 1510, pages 38-46, 1998.
29. R. Feldman, Y. Aumann, A. Zilberstein, and Y. Ben-Yehuda, “Trend Graphs: Visualizing the
Evolution of Concept Relationships in Large Document Collections.” In Principles of Data Mining
and Knowledge Discovery (PKDD), LNCS vol. 1510, pages 38-46, 1998.
30. Y. Aumann and A. Kapach-Levy. “Cooperative Sharing and Asynchronous Consensus Using
Single-Reader/Single-Writer Registers”. In Proceedings of 10th Annual ACM-SIAM Symposium
of Discrete Algorithms (SODA), pages 61-70, 1999.
31. R. Feldman, Y. Aumann, Y. Liberzon, K. Ankori, Y. Schler, and B. Rosenfeld. “A Domain
Independent Environment for Creating Information Extraction Modules”. In Proceedings of the
2001 ACM CIKM International Conference on Information and Knowledge Management (CIKM),
pages 586-588, 2001.
32. R. Feldman, Y. Aumann, M. Finkelstein-Landau, Y. Hurvitz, Y. Regev, and A. Yaroshevich. “A
Comparative Study of Information Extraction Strategies”. In Proceedings of the Third
International Conference on Computational Linguistics and Intelligent Text Processing
(CICLing), pages 349-359, 2002.
33. B. Rosenfled, R. Feldman and Y. Aumann. “Structural Extraction from Visual Layout of
Documents”. In Proceedings of the 2002 ACM CIKM International Conference on Information
and Knowledge Management (CIKM), pages 203-210, November, 2002.
34. Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, and Z. Yakhini. “Dotted Interval Graphs and
High Throughput Genotyping”. In Proceedings of 26th Annual ACM-SIAM Symposium of
Discrete Algorithms (SODA), pages 339-348, 2005.
35. A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky, E. Porat, S. Skiena and U. Vishne. “Pattern
Matching with Address Errors: Rearrangement Distances”. In Proceedings of the 27th Annual
ACM-SIAM Symposium of Discrete Algorithms (SODA), pages 1221-1229, 2006.

Patents
US Patent 6,442,545: “Term-level text with mining with taxonomies” (with Y. Ben-Yehuda, R.
Feldman, D. Landau, O. Lipshtat and J. Schler,), August 27, 2002.
US Patent 6,532,469: “Determining trends using text mining” (with Y. Ben-Yehuda, R.
Feldman, and D. Landau), March 11, 2003.