פרופ' יהונתן אומן

פרופ'
פרופ' יהונתן אומן
טלפון: 
פקס: 
דוא"ל: 
משרד: 
שעות קבלה: 

פירסומים

Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini: Dotted interval graphs. ACM Transactions on Algorithms 8(2): 9 (2012)

Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko: Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422: 1-14 (2012)

Orit Arzi, Yonatan Aumann, Yair Dombb: Throw One's Cake - and Eat It Too. SAGT 2011: 69-80

Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding witnesses by peeling. ACM Transactions on Algorithms 7(2): 24 (2011)

Tammar Shrot, Yonatan Aumann, Sarit Kraus: On agent types in coalition formation problems. AAMAS 2010: 757-764

Yonatan Aumann, Yair Dombb: Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games. SAGT 2010: 66-77

Yonatan Aumann, Yair Dombb: The Efficiency of Fair Division with Connected Pieces. WINE 2010: 26-37

Yonatan Aumann, Yehuda Lindell: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. J. Cryptology 23(2): 281-343 (2010)

Tammar Shrot, Yonatan Aumann, Sarit Kraus: Easy and hard coalition resource game formation problems: a parameterized complexity analysis. AAMAS (1) 2009: 433-440

Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko: Quasi-distinct Parsing and Optimal Compression Methods. CPM 2009: 12-25

Noam Hazon, Yonatan Aumann, Sarit Kraus: Collaborative Multi Agent Physical Search with Probabilistic Knowledge. IJCAI 2009: 167-174

Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne: Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6): 359-370 (2009)

Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient computations of l1 and l INFINITY rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009)

Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate string matching with address bit errors. Theor. Comput. Sci. 410(51): 5334-5346 (2009)

Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sarne: Physical Search Problems Applying Economic Search Models. AAAI 2008: 9-16

Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael Wooldridge: Evaluation of election outcomes under uncertainty. AAMAS (2) 2008: 959-966

Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate String Matching with Address Bit Errors. CPM 2008: 118-129

Yonatan Aumann, Yair Dombb: Fixed Structure Complexity. IWPEC 2008: 30-42

Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding Witnesses by Peeling. CPM 2007: 28-39

Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49

Yonatan Aumann, Yehuda Lindell: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. TCC 2007: 137-156

Doron Lipson, Zohar Yakhini, Yonatan Aumann: Optimization of probe coverage for high-resolution oligonucleotide aCGH. Bioinformatics 23(2): 77-83 (2007)

 

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).
 
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.
 
Aumann, Yonatan, Lindell, Yehuda. "A Statistical Theory For Quantitative Association Rules" JIIS, vol. 20, 2003, p. 255-283.
 
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.
 
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.
 
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.
 
Rosenfeld, Binyamin, Feldman, Ronen, Aumann, Yonatan. "Structural Extraction from Visual Layout of Documents" CIKM, 2002, p. 203-210.
 
Aumann, Y.; Hastad, J.; Rabin, M.O. and Sudan, M. "Linear-Consistency Testing" J. Comput. Syst. Sci., vol. 62, 2001, p. 589-607.
 
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.
 
Amir, Amihood, Aumann, Yonatan, Landau, G.M., Lewenstein, Moshe, Lewenstein, N.. "Pattern Matching with Swaps" Journal of Algorithms, vol. 37, 2000, p. 247-266.
 
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.
 
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.
 
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.
 
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.
 
Aumann, Y. and Kapach-Levy, A. "Cooperative Sharing And Asynchronous Consensus Using Single-Reader/ Single-Writer Registers" SODA, 1999, p. 61-70.
 
Aumann, Y.; Hastaad, J.; Rabin, M.O. and Sundan, M. "Linear Consistency Testing" RANDOM-APPROX, 1999, p. 109-120.
 
Aumann, Yonatan, Hastad, Johan, Rabin, Michael O., Sudan, Madhu. "Linear Constitency Testing" ECCC, vol. 6, 1999.
 
Aumann, Yonatan, Lindell, Yehuda . "A Statistical Theory For Quantitative Association Rules" KDD, 1999, p. 261-270.
 
Aumann, Yonatan, Rabin, Michael O.. "Information Theoretically Secure Communication in the Limited Strage Space Model" CRYPTO, 1999, p. 65-79.
 
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.
 
Aumann, Y. and Rabin, M.O. "Authentication, Enhanced Security and Error Correcting Codes" Advances in Cryptology, vol. 1462, 1998, p. 299-303.
 
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.
 
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.
 
Feldman, Ronen, Fresko, Moshe , Hirsh, Haym, Aumann, Yonatan, Liphstat, Orly, Schler, Yonatan, Rajman, Martin. "Knowledge Management: A Text Mining Approach" PAKM, 1998.
 
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.
 
Amir, Amihood, Aumann, Yonatan, Landau, G., Lewenstein, N., Lewenstein, Moshe. "Pattern Matching With Swaps" Foundations of Computer Science (FOCS), 1997, p. 148-153.
 
Feldman, R.; Aumann, Y.; Amir, A. and Mannila, H. "Efficient Algorithms for Discovering Frequent Sets in Incremenal Databases" DMKD, 1997.
 
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.
 
Aumann, Yonatan. "Efficient Asynchronous Consensus With the Weak Adversary Scheduler" PODC, 1997, p. 209-218.
 
Amir, A.; Feldman, R.; Aumann, Y.; Zilberstein, A. and Hirsh, H. "Incremental Algorithms for Association Generation" Proc., 1st Pacific Conference on Knowledge Discovery, 1996.
 
Aumann, Yonatan, Bender, Michael A., Zhang, Lisa. "Efficient Execution of Nondeterministic Parallel Programs On Asynchronous Systems" SPAA, 1996, p. 270-276.
 
Aumann, Yonatan, Bender, Michael A.. "Efficient Asynchronous Consensus With the Value-Oblivious Adversary Scheduler" ICALP, 1996, p. 622-633.
 
Aumann, Yonatan, Bender, Michael A.. "Fault Tolerant Data Structures" FOCS, 1996, p. 580-589.
 
Aumann, Y. and Rabani, Y. "Improved Bounds for All Optical Routing" Proc. Of the Annual ACM Symposium on Discrete Algorithms, 1995, p. 567-576.
 
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.
 
Aumann, Y. and Feige, U. "One Message Proof Systems with Known Space Verifies" Proc. Of Crypto '93, Springer-Verlag, 1993, p. 85-99.
 
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.
 
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.
 
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.
 
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.
 
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.
 
Aumann, Yonatan, Schuster, A.. "Improved Memory Utilization in Detreministic PRAM Simulation" J. Parallel and Distributed Computing, vol. 12, 1991, p. 146-151.
 
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.

 

 

תחומי מחקר

אלגוריתמים, אלגוריתמים מקביליים, הצפנה,  אלגוריתמים מבוזרים ואסינכרוניים