Yonatan Aumann Papers on DiSC'02 A domain independent environment for creating information extraction modules Publications Note: Links lead to the DBLP on the Web. Yonatan Aumann 33 Ronen Feldman , Yonatan Aumann, Michal Finkelstein-Landau , Eyal Hurvitz , Yizhar Regev , Ariel Yaroshevich : A Comparative Study of Information Extraction Strategies. CICLing 2002 : 349-359 32 Ronen Feldman , Yonatan Aumann, Yair Liberzon , Kfir Ankori , Jonathan Schler , Benjamin Rosenfeld : A Domain Independent Environment for Creating Information Extraction Modules. CIKM 2001 : 586-588 31 Yonatan Aumann, Johan Håstad , Michael O. Rabin , Madhu Sudan : Linear-Consistency Testing. JCSS 62 (4): 589-607 (2001) 30 Amihood Amir , Yonatan Aumann, Gad M. Landau , Moshe Lewenstein , Noa Lewenstein : Pattern Matching with Swaps. J. Algorithms 37 (2): 247-266 (2000) 29 Yonatan Aumann, Judit Bar-Ilan , Uriel Feige : On the cost of recomputing: Tight bounds on pebbling with faults. TCS 233 (1-2): 247-261 (2000) 28 Yonatan Aumann, Michael O. Rabin : Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO 1999 : 65-79 27 Yonatan Aumann, Yehuda Lindell : A Statistical Theory for Quantitative Association Rules. KDD 1999 : 261-270 26 Ronen Feldman , Yonatan Aumann, Moshe Fresko , Orly Lipshtat , Binyamin Rosenfeld , Yonatan Schler : Text Mining via Information Extraction. PKDD 1999 : 165-173 25 Yonatan Aumann, Ronen Feldman , Yaron Ben Yehuda , David Landau , Orly Lipshtat , Yonatan Schler : Circle Graphs: New Visualization Tools for Text-Mining. PKDD 1999 : 277-282 24 Yonatan Aumann, Johan Håstad , Michael O. Rabin , Madhu Sudan : Linear Consistency Testing. RANDOM-APPROX 1999 : 109-120 23 Yonatan Aumann, Avivit Kapah-Levy : Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. SODA 1999 : 61-70 22 Yonatan Aumann, Johan Håstad , Michael O. Rabin , Madhu Sudan : Linear Consistency Testing. Electronic Colloquium on Computational Complexity (ECCC) 6 (25): (1999) 21 Yonatan Aumann, Ronen Feldman , Orly Liphstat , Heikki Mannila : Borders: An Efficient Algorithm for Association Generation in Dynamic Databases. JIIS 12 (1): 61-73 (1999) 20 Yonatan Aumann, Michael O. Rabin : Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). CRYPTO 1998 : 299-303 19 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 18 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 17 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) 16 Ronen Feldman , Yonatan Aumann, Amihood Amir , Heikki Mannila : Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD 1997 : 0- 15 Amihood Amir , Yonatan Aumann, Gad M. Landau , Moshe Lewenstein , Noa Lewenstein : Pattern Matching with Swaps. FOCS 1997 : 144-153 14 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 13 Yonatan Aumann: Efficient Asynchronous Consensus with the Weak Adversary Scheduler. PODC 1997 : 209-218 12 Yonatan Aumann, Michael A. Bender , Y. Lisa Zhang : Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. Information and Computation 139 (1): 1-16 (1997) 11 Yonatan Aumann, Michael A. Bender : Fault Tolerant Data Structures. FOCS 1996 : 580-589 10 Yonatan Aumann, Michael A. Bender : Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ICALP 1996 : 622-633 9 Yonatan Aumann, Michael A. Bender , Y. Lisa Zhang : Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. SPAA 1996 : 270-276 8 Yonatan Aumann, Yuval Rabani : Improved Bounds for All Optical Routing. SODA 1995 : 567-576 7 Yonatan Aumann, Judit Bar-Ilan , Uriel Feige : On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. ICALP 1994 : 47-58 6 Yonatan Aumann, Michael O. Rabin : Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. TCS 128 (1&2): 3-30 (1994) 5 Yonatan Aumann, Uriel Feige : On Message Proof Systems with Known Space Verifiers. CRYPTO 1993 : 85-99 4 Yonatan Aumann, Zvi M. Kedem , Krishna V. Palem , Michael O. Rabin : Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs. FOCS 1993 : 271-280 3 Yonatan Aumann, Michael O. Rabin : Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract). FOCS 1992 : 147-156 2 Yonatan Aumann, Michael Ben-Or : Computing with Faulty Arrays. STOC 1992 : 162-169 1 Yonatan Aumann, Michael Ben-Or : Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract). FOCS 1991 : 440-446 DiSC'02 © 2003 Association for Computing Machinery