Research People
Faculty Visitors and Lecturers Staff Graduate Students Alumni Positions Available
Studies Resources


Prof. Aumann Yonatan
Office: Building 216 room 225
Office Hours: Sunday 13:00-14:00
Telephone: (+ 972 3) 531 8629
Email: aumann @ cs.biu.ac.il
Personal web page:
Mailing address: Department of Computer Science
Bar Ilan University,
Ramat Gan, 52900, Israel

Research Interests: Algorithms, Pattern matching, Computational Biology, Cryptography, Data and Text Mining, Parametrized Complexity

Research Description: My research spans many subjects within the general field of theory of computing, with an aim to bring theory to practice.  As such, I also involved in research on computational biology, and data and text mining. My theory interests cover parallel and distributed algorithms, cryptography, approximation algorithms, pattern matching, parametrized complexity and more.

Graduate Students:

Present Past
Michal Dvir
Yair Dombb
Asher Stern

Moshe Lewenstein
Yehuda Lindell
Efrat Manistersky
Avivit Levy
Oren Malmud
Demintry Pogrebinsky
Yaniv Ben Yehuda

Selected Publications:

  1. Aumann, Y. and Rabani, Y. "The Minimal Number of Wavelenghts Necessary for Routing Permutations in All Optical Networks" Information Processing Letters, vol. Accepted for publication (in press).

  2. Amir, Amihood, Aumann, Yonatan, Cole, R., Lewenstein, Moshe, Porat, Ely. "Function Matching: Algorithms, Applications And a Lower Bound" ICALP, vol. 2719, 2003, p. 929-942.

  3. Aumann, Yonatan, Lindell, Yehuda. "A Statistical Theory For Quantitative Association Rules" JIIS, vol. 20, 2003, p. 255-283.

  4. Aumann, Yonatan, Manisterski, E., Yakhini, Z.. "Designing Optimally Multiplexed SNP Genotyping Assays" (ed.) Lecture Notes in Computer Science: Proceedings of the Workshop On Algorithms in Bioinformatics, p. 320-338., Springer, 2003.

  5. Aumann, Y.; Ding, YZ. and Rabin, MO. "Everlasting Security in the Bounded Storage Model" IEEE Transactions on Information Theory, vol. 48, 2002, p. 1668-1680.

  6. Feldman, R.; Aumann, Y.; Finklestein-Landau, M.; Hurvitz, E. and Regev, Y. "A Comparative Study of Information Extraction Strategies" CICLing 2002, 2002, p. 349-359.

  7. Rosenfeld, Binyamin, Feldman, Ronen, Aumann, Yonatan. "Structural Extraction from Visual Layout of Documents" CIKM, 2002, p. 203-210.

  8. Aumann, Y.; Hastad, J.; Rabin, M.O. and Sudan, M. "Linear-Consistency Testing" J. Comput. Syst. Sci., vol. 62, 2001, p. 589-607.

  9. Feldman, R.; Aumann, Y.; Liberzon, Y.; Ankori, K.; Schler, J. and Rosenfeld, B. "A Domain Independent Environment For Creating Information Extraction Modules" (ed.) CIKM 2001, p. 586-588., ACM, 2001.

  10. Amir, Amihood, Aumann, Yonatan, Landau, G.M., Lewenstein, Moshe, Lewenstein, N.. "Pattern Matching with Swaps" Journal of Algorithms, vol. 37, 2000, p. 247-266.

  11. Aumann, Yonatan, Bar-Ilan, Judit, Feige, Uriel. "On the cost of recomputing: Tight bounds on pebbling with faults" Theoretical Computer Science, vol. 233, 2000, p. 247-261.

  12. Aumann, Y.; Feldman, R.; Fresko, M.; Liphstat, O.; Rosenfeld, B. and Schler, Y. "Text Mining Via Information Extraction" Lect Note Artif Intell, vol. 1704, 1999, p. 165-173.

  13. Aumann, Y.; Feldman, R.; Liphstat, O. and Mannila, H. "Borders: An Efficient Algorithm for Association Generation in Dynamic Databases" JIIS, vol. 12, 1999, p. 61-73.

  14. Aumann, Y.; Feldman, R.; Ben-Yehuda, Y.; Landau, D.; Liphstat, O. and Schler, Y. "Circle Graphs: New Visualization Tools for Text-Mining" PKDD, 1999, p. 277-282.

  15. Aumann, Y. and Kapach-Levy, A. "Cooperative Sharing And Asynchronous Consensus Using Single-Reader/ Single-Writer Registers" SODA, 1999, p. 61-70.

  16. Aumann, Y.; Hastaad, J.; Rabin, M.O. and Sundan, M. "Linear Consistency Testing" RANDOM-APPROX, 1999, p. 109-120.

  17. Aumann, Yonatan, Hastad, Johan, Rabin, Michael O., Sudan, Madhu. "Linear Constitency Testing" ECCC, vol. 6, 1999.

  18. Aumann, Yonatan, Lindell, Yehuda . "A Statistical Theory For Quantitative Association Rules" KDD, 1999, p. 261-270.

  19. Aumann, Yonatan, Rabin, Michael O.. "Information Theoretically Secure Communication in the Limited Strage Space Model" CRYPTO, 1999, p. 65-79.

  20. Aumann, Y. and Rabani, Y. "An O(log K) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm" SIAM Journal of Computing, vol. 27, 1998, p. 291-301.

  21. Aumann, Y. and Rabin, M.O. "Authentication, Enhanced Security and Error Correcting Codes" Advances in Cryptology, vol. 1462, 1998, p. 299-303.

  22. Feldman, R.; Aumann, Y.; Zilberstein, A. and Ben-Yehuda, Y. "Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections" Principles of Data Mining and Knowledge Discovery, vol. 1510, 1998, p. 38-46.

  23. Landau, D.; Feldman, R.; Aumann, Y.; Fresko, M. Lindell, Y.; Lipshtat, O. and Zamir, O. "Text-Vis: An Integrated Visual Environment for Text Mining" Principles of Data Mining and Knowledge Discovery, vol. 1510, 1998, p. 38-46.

  24. Feldman, Ronen, Fresko, Moshe , Hirsh, Haym, Aumann, Yonatan, Liphstat, Orly, Schler, Yonatan, Rajman, Martin. "Knowledge Management: A Text Mining Approach" PAKM, 1998.

  25. Aumann, Y.; Bender, M. and Zhang, Y.L. "Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems" Information and Computation, vol. 139, 1997, p. 1-16.

  26. Amir, Amihood, Aumann, Yonatan, Landau, G., Lewenstein, N., Lewenstein, Moshe. "Pattern Matching With Swaps" Foundations of Computer Science (FOCS), 1997, p. 148-153.

  27. Feldman, R.; Aumann, Y.; Amir, A. and Mannila, H. "Efficient Algorithms for Discovering Frequent Sets in Incremenal Databases" DMKD, 1997.

  28. Feldman, R.; Aumann, Y.; Amir, A.; Zilberstein, A. and Klosgen, W. "Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections" KDD, 1997, p. 167-170.

  29. Aumann, Yonatan. "Efficient Asynchronous Consensus With the Weak Adversary Scheduler" PODC, 1997, p. 209-218.

  30. Amir, A.; Feldman, R.; Aumann, Y.; Zilberstein, A. and Hirsh, H. "Incremental Algorithms for Association Generation" Proc., 1st Pacific Conference on Knowledge Discovery, 1996.

  31. Aumann, Yonatan, Bender, Michael A., Zhang, Lisa. "Efficient Execution of Nondeterministic Parallel Programs On Asynchronous Systems" SPAA, 1996, p. 270-276.

  32. Aumann, Yonatan, Bender, Michael A.. "Efficient Asynchronous Consensus With the Value-Oblivious Adversary Scheduler" ICALP, 1996, p. 622-633.

  33. Aumann, Yonatan, Bender, Michael A.. "Fault Tolerant Data Structures" FOCS, 1996, p. 580-589.

  34. Aumann, Y. and Rabani, Y. "Improved Bounds for All Optical Routing" Proc. Of the Annual ACM Symposium on Discrete Algorithms, 1995, p. 567-576.

  35. Aumann, Y. and Rabin, M.O. "Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation" Theoretical Computer Science, vol. 128, 1994, p. 3-30.

  36. Aumann, Y. and Feige, U. "One Message Proof Systems with Known Space Verifies" Proc. Of Crypto '93, Springer-Verlag, 1993, p. 85-99.

  37. Aumann, Y.; Palem, K.; Kedem, Z. and Rabin, M.O. "Highly Efficient Asynchronous Execution of Large Grained Parallel Programs" Proceedings of the 34th Annual Symposium on the Foundations of Computer Science, 1993, p. 271-280.

  38. Aumann, Y. and Ben-Or, M. "Computing with Faulty Arays" Proc. Of the 24th Annual ACM Symposium on the Theory of Computing, 1992, p. 162-169.

  39. Aumann, Y. and Rabin, M.O. "Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation" Proc. Of the 33rd Annual Symposium on the Foundations of Computer Science, 1992, p. 147-156.

  40. Aumann, Y. and Parnas, H. "Evaluation of the Time Course of Neurotransmitter Release from the Measured PSC and MPSC" Bull. Math. Biol., vol. 53, 1991, p. 537-555.

  41. Aumann, Y. and Ben-Or, M, "Asymptotically Optimal PRAM Emulation on Faulty Hypercubes" Proc. Of the 32nd Annual Symposium on the Foundations of Computer Science, 1991.

  42. Aumann, Yonatan, Schuster, A.. "Improved Memory Utilization in Detreministic PRAM Simulation" J. Parallel and Distributed Computing, vol. 12, 1991, p. 146-151.

  43. Aumann, Y. and Schuster, A. "Deterministic PRAM Simulation with Constant Memory Blowup and No Time Stamps" Proc. Of the Third Symposium on the Fronties of Massively Parallel Computation, 1990.