| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Yonatan Aumann Doron Lipson , Yonatan Aumann, Amir Ben-Dor , Nathan Linial , Zohar Yakhini : Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. RECOMB 2005 : 83-100 Yonatan Aumann, Michael A. Bender : Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Computing 17 (3): 191-207 (2005) Binyamin Rosenfeld , Ronen Feldman , Moshe Fresko , Jonathan Schler , Yonatan Aumann: TEG: a hybrid approach to information extraction. CIKM 2004 : 589-596 Amihood Amir , Yonatan Aumann, Richard Cole , Moshe Lewenstein , Ely Porat : Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003 : 929-942 Yonatan Aumann, Efrat Manisterski , Zohar Yakhini : Designing Optimally Multiplexed SNP Genotyping Assays. WABI 2003 : 320-338 Yonatan Aumann, Yehuda Lindell : A Statistical Theory for Quantitative Association Rules. J. Intell. Inf. Syst. 20 (3): 255-283 (2003) Ronen Feldman , Yonatan Aumann, Michal Finkelstein-Landau , Eyal Hurvitz , Yizhar Regev , Ariel Yaroshevich : A Comparative Study of Information Extraction Strategies. CICLing 2002 : 349-359 Binyamin Rosenfeld , Ronen Feldman , Yonatan Aumann: Structural extraction from visual layout of documents. CIKM 2002 : 203-210 Yonatan Aumann, Yan Zong Ding , Michael O. Rabin : Everlasting security in the bounded storage model. IEEE Transactions on Information Theory 48 (6): 1668-1680 (2002) Ronen Feldman , Yonatan Aumann, Yair Liberzon , Kfir Ankori , Yonatan Schler , Binyamin Rosenfeld : A Domain Independent Environment for Creating Information Extraction Modules. CIKM 2001 : 586-588 Yonatan Aumann, Johan Håstad , Michael O. Rabin , Madhu Sudan : Linear-Consistency Testing. J. Comput. Syst. Sci. 62 (4): 589-607 (2001) Amihood Amir , Yonatan Aumann, Gad M. Landau , Moshe Lewenstein , Noa Lewenstein : Pattern Matching with Swaps. J. Algorithms 37 (2): 247-266 (2000) Yonatan Aumann, Judit Bar-Ilan , Uriel Feige : On the cost of recomputing: Tight bounds on pebbling with faults. Theor. Comput. Sci. 233 (1-2): 247-261 (2000) Yonatan Aumann, Michael O. Rabin : Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO 1999 : 65-79 Yonatan Aumann, Yehuda Lindell : A Statistical Theory for Quantitative Association Rules. KDD 1999 : 261-270 Ronen Feldman , Yonatan Aumann, Moshe Fresko , Orly Liphstat , Binyamin Rosenfeld , Yonatan Schler : Text Mining via Information Extraction. PKDD 1999 : 165-173 Yonatan Aumann, Ronen Feldman , Yaron Ben-Yehuda , David Landau , Orly Liphstat , Yonatan Schler : Circle Graphs: New Visualization Tools for Text-Mining. PKDD 1999 : 277-282 Yonatan Aumann, Johan Håstad , Michael O. Rabin , Madhu Sudan : Linear Consistency Testing. RANDOM-APPROX 1999 : 109-120 Yonatan Aumann, Avivit Kapah-Levy : Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. SODA 1999 : 61-70 Yonatan Aumann, Johan Håstad , Michael O. Rabin , Madhu Sudan : Linear Consistency Testing Electronic Colloquium on Computational Complexity (ECCC) 6 (25): (1999) Yonatan Aumann, Ronen Feldman , Orly Liphstat , Heikki Mannila : Borders: An Efficient Algorithm for Association Generation in Dynamic Databases. J. Intell. Inf. Syst. 12 (1): 61-73 (1999) Yonatan Aumann, Michael O. Rabin : Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). CRYPTO 1998 : 299-303 Ronen Feldman , Moshe Fresko , Haym Hirsh , Yonatan Aumann, Orly Liphstat , Yonatan Schler , Martin Rajman : Knowledge Management: A Text Mining Approach. PAKM 1998 Ronen Feldman , Yonatan Aumann, Amir Zilberstein , Yaron Ben-Yehuda : Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections. PKDD 1998 : 38-46 David Landau , Ronen Feldman , Yonatan Aumann, Moshe Fresko , Yehuda Lindell , Orly Liphstat , Oren Zamir : TextVis: An Integrated Visual Environment for Text Mining. PKDD 1998 : 56-64 Yonatan Aumann, Yuval Rabani : An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM J. Comput. 27 (1): 291-301 (1998) Ronen Feldman , Yonatan Aumann, Amihood Amir , Heikki Mannila : Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD 1997 : 0- Amihood Amir , Yonatan Aumann, Gad M. Landau , Moshe Lewenstein , Noa Lewenstein : Pattern Matching with Swaps. FOCS 1997 : 144-153 Ronen Feldman , Yonatan Aumann, Amihood Amir , Amir Zilberstein , Willi Klösgen : Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. KDD 1997 : 167-170 Yonatan Aumann: Efficient Asynchronous Consensus with the Weak Adversary Scheduler. PODC 1997 : 209-218 Yonatan Aumann, Michael A. Bender , Lisa Zhang : Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. Inf. Comput. 139 (1): 1-16 (1997) Yonatan Aumann, Michael A. Bender : Fault Tolerant Data Structures. FOCS 1996 : 580-589 Yonatan Aumann, Michael A. Bender : Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ICALP 1996 : 622-633 Yonatan Aumann, Michael A. Bender , Lisa Zhang : Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. SPAA 1996 : 270-276 Yonatan Aumann, Yuval Rabani : Improved Bounds for All Optical Routing. SODA 1995 : 567-576 Yonatan Aumann, Judit Bar-Ilan , Uriel Feige : On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. ICALP 1994 : 47-58 Yonatan Aumann, Michael O. Rabin : Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. Theor. Comput. Sci. 128 (1&2): 3-30 (1994) Yonatan Aumann, Uriel Feige : On Message Proof Systems with Known Space Verifiers. CRYPTO 1993 : 85-99 Yonatan Aumann, Zvi M. Kedem , Krishna V. Palem , Michael O. Rabin : Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs FOCS 1993 : 271-280 Yonatan Aumann, Michael O. Rabin : Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) FOCS 1992 : 147-156 Yonatan Aumann, Michael Ben-Or : Computing with Faulty Arrays STOC 1992 : 162-169 Yonatan Aumann, Michael Ben-Or : Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) FOCS 1991 : 440-446 Yonatan Aumann, Assaf Schuster : Improved Memory Utilization in Deterministic PRAM Simulation. J. Parallel Distrib. Comput. 12 (2): 146-151 (1991) 1 [ 15 ] [ 16 ] [ 17 ] [ 32 ] [ 40 ] 2 [ 34 ] 3 [ 8 ] [ 31 ] 4 [ 43 ] 5 [ 2 ] [ 3 ] 6 [ 20 ] [ 27 ] 7 [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 42 ] 8 [ 40 ] 9 [ 35 ] 10 [ 6 ] [ 8 ] [ 31 ] 11 [ 15 ] [ 17 ] [ 19 ] [ 20 ] [ 21 ] [ 23 ] [ 27 ] [ 28 ] [ 34 ] [ 36 ] [ 37 ] [ 41 ] 12 [ 37 ] 13 [ 19 ] [ 21 ] [ 28 ] [ 41 ] 14 [ 24 ] [ 26 ] [ 33 ] 15 [ 21 ] 16 [ 37 ] 17 [ 25 ] 18 [ 5 ] 19 [ 15 ] 20 [ 19 ] [ 27 ] 21 [ 16 ] [ 32 ] 22 [ 16 ] [ 32 ] [ 40 ] 23 [ 16 ] [ 32 ] 24 [ 34 ] 25 [ 19 ] [ 29 ] [ 38 ] 26 [ 43 ] 27 [ 19 ] [ 21 ] [ 23 ] [ 27 ] [ 28 ] 28 [ 43 ] 29 [ 39 ] 30 [ 17 ] [ 23 ] 31 [ 5 ] 32 [ 40 ] 33 [ 9 ] [ 18 ] 34 [ 4 ] [ 5 ] [ 7 ] [ 22 ] [ 24 ] [ 26 ] [ 30 ] [ 33 ] [ 35 ] 35 [ 21 ] 36 [ 37 ] 37 [ 28 ] [ 34 ] [ 36 ] [ 41 ] 38 [ 41 ] 39 [ 21 ] [ 27 ] [ 28 ] [ 34 ] 40 [ 1 ] 41 [ 24 ] [ 26 ] [ 33 ] 42 [ 39 ] [ 43 ] 43 [ 37 ] 44 [ 19 ] 45 [ 10 ] [ 13 ] 46 [ 15 ] [ 20 ]  ©2005 Association for Computing Machinery |
