2008 | ||
---|---|---|
58 | Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sarne: Physical Search Problems Applying Economic Search Models. AAAI 2008: 9-16 | |
57 | EE | Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael Wooldridge: Evaluation of election outcomes under uncertainty. AAMAS (2) 2008: 959-966 |
56 | EE | Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate String Matching with Address Bit Errors. CPM 2008: 118-129 |
55 | EE | Yonatan Aumann, Yair Dombb: Fixed Structure Complexity. IWPEC 2008: 30-42 |
2007 | ||
54 | EE | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding Witnesses by Peeling. CPM 2007: 28-39 |
53 | EE | Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49 |
52 | EE | Yonatan Aumann, Yehuda Lindell: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. TCC 2007: 137-156 |
51 | EE | Doron Lipson, Zohar Yakhini, Yonatan Aumann: Optimization of probe coverage for high-resolution oligonucleotide aCGH. Bioinformatics 23(2): 77-83 (2007) |
2006 | ||
50 | EE | Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne: Pattern matching with address errors: rearrangement distances. SODA 2006: 1221-1229 |
49 | EE | Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini: Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. Journal of Computational Biology 13(2): 215-228 (2006) |
48 | EE | Yonatan Aumann, Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, Jonathan Schler: Visual information extraction. Knowl. Inf. Syst. 10(1): 1-15 (2006) |
47 | EE | Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat: Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006) |
2005 | ||
46 | EE | 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 |
45 | EE | Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini: Dotted interval graphs and high throughput genotyping. SODA 2005: 339-348 |
44 | EE | Yonatan Aumann, Michael A. Bender: Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Computing 17(3): 191-207 (2005) |
43 | EE | Yonatan Aumann, Efrat Manisterski, Zohar Yakhini: Designing optimally multiplexed SNP genotyping assays. J. Comput. Syst. Sci. 70(3): 399-417 (2005) |
42 | EE | Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko: Maximal Association Rules: A Tool for Mining Associations in Text. J. Intell. Inf. Syst. 25(3): 333-345 (2005) |
2004 | ||
41 | EE | Binyamin Rosenfeld, Ronen Feldman, Moshe Fresko, Jonathan Schler, Yonatan Aumann: TEG: a hybrid approach to information extraction. CIKM 2004: 589-596 |
2003 | ||
40 | EE | Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat: Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942 |
39 | EE | Yonatan Aumann, Efrat Manisterski, Zohar Yakhini: Designing Optimally Multiplexed SNP Genotyping Assays. WABI 2003: 320-338 |
38 | Yonatan Aumann, Yehuda Lindell: A Statistical Theory for Quantitative Association Rules. J. Intell. Inf. Syst. 20(3): 255-283 (2003) | |
2002 | ||
37 | EE | Ronen Feldman, Yonatan Aumann, Michal Finkelstein-Landau, Eyal Hurvitz, Yizhar Regev, Ariel Yaroshevich: A Comparative Study of Information Extraction Strategies. CICLing 2002: 349-359 |
36 | EE | Binyamin Rosenfeld, Ronen Feldman, Yonatan Aumann: Structural extraction from visual layout of documents. CIKM 2002: 203-210 |
35 | 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) | |
2001 | ||
34 | 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 | |
33 | Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan: Linear-Consistency Testing. J. Comput. Syst. Sci. 62(4): 589-607 (2001) | |
2000 | ||
32 | Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Pattern Matching with Swaps. J. Algorithms 37(2): 247-266 (2000) | |
31 | EE | 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) |
1999 | ||
30 | EE | Yonatan Aumann, Michael O. Rabin: Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO 1999: 65-79 |
29 | EE | Yonatan Aumann, Yehuda Lindell: A Statistical Theory for Quantitative Association Rules. KDD 1999: 261-270 |
28 | Ronen Feldman, Yonatan Aumann, Moshe Fresko, Orly Liphstat, Binyamin Rosenfeld, Yonatan Schler: Text Mining via Information Extraction. PKDD 1999: 165-173 | |
27 | 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 | |
26 | Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan: Linear Consistency Testing. RANDOM-APPROX 1999: 109-120 | |
25 | EE | Yonatan Aumann, Avivit Kapah-Levy: Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. SODA 1999: 61-70 |
24 | EE | Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan: Linear Consistency Testing Electronic Colloquium on Computational Complexity (ECCC) 6(25): (1999) |
23 | 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) | |
1998 | ||
22 | EE | Yonatan Aumann, Michael O. Rabin: Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). CRYPTO 1998: 299-303 |
21 | EE | Ronen Feldman, Moshe Fresko, Haym Hirsh, Yonatan Aumann, Orly Liphstat, Yonatan Schler, Martin Rajman: Knowledge Management: A Text Mining Approach. PAKM 1998 |
20 | 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 | |
19 | 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 | |
18 | 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) | |
1997 | ||
17 | Ronen Feldman, Yonatan Aumann, Amihood Amir, Heikki Mannila: Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD 1997: 0- | |
16 | EE | Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Pattern Matching with Swaps. FOCS 1997: 144-153 |
15 | 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 | |
14 | Yonatan Aumann: Efficient Asynchronous Consensus with the Weak Adversary Scheduler. PODC 1997: 209-218 | |
13 | Yonatan Aumann, Michael A. Bender, Lisa Zhang: Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. Inf. Comput. 139(1): 1-16 (1997) | |
1996 | ||
12 | Yonatan Aumann, Michael A. Bender: Fault Tolerant Data Structures. FOCS 1996: 580-589 | |
11 | Yonatan Aumann, Michael A. Bender: Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ICALP 1996: 622-633 | |
10 | Yonatan Aumann, Michael A. Bender, Lisa Zhang: Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. SPAA 1996: 270-276 | |
1995 | ||
9 | Yonatan Aumann, Yuval Rabani: Improved Bounds for All Optical Routing. SODA 1995: 567-576 | |
1994 | ||
8 | Yonatan Aumann, Judit Bar-Ilan, Uriel Feige: On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. ICALP 1994: 47-58 | |
7 | Yonatan Aumann, Michael O. Rabin: Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. Theor. Comput. Sci. 128(1&2): 3-30 (1994) | |
1993 | ||
6 | EE | Yonatan Aumann, Uriel Feige: On Message Proof Systems with Known Space Verifiers. CRYPTO 1993: 85-99 |
5 | Yonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin: Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs FOCS 1993: 271-280 | |
1992 | ||
4 | Yonatan Aumann, Michael O. Rabin: Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) FOCS 1992: 147-156 | |
3 | Yonatan Aumann, Michael Ben-Or: Computing with Faulty Arrays STOC 1992: 162-169 | |
1991 | ||
2 | Yonatan Aumann, Michael Ben-Or: Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) FOCS 1991: 440-446 | |
1 | Yonatan Aumann, Assaf Schuster: Improved Memory Utilization in Deterministic PRAM Simulation. J. Parallel Distrib. Comput. 12(2): 146-151 (1991) |