The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Yonatan Aumann" ( http://dblp.L3S.de/Authors/Yonatan_Aumann )

  Author page on DBLP  Author page in RDF  Community of Yonatan Aumann in ASPL-2

Publication years (Num. hits)
1991-1997 (17) 1998-2000 (15) 2001-2006 (18) 2007-2009 (15) 2010-2012 (15) 2013-2016 (23) 2017-2019 (7)
Publication types (Num. hits)
article(48) inproceedings(62)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 32 occurrences of 28 keywords

Results
Found 111 publication records. Showing 110 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Priel Levy, David Sarne, Yonatan Aumann Selective Information Disclosure in Contests. Search on Bibsonomy AAMAS The full citation details ... 2019 DBLP  BibTeX  RDF
1Priel Levy, David Sarne, Yonatan Aumann Temporal Information Design in Contests. Search on Bibsonomy IJCAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann MUDA: A Truthful Multi-Unit Double-Auction Mechanism. Search on Bibsonomy AAAI The full citation details ... 2018 DBLP  BibTeX  RDF
1Priel Levy, David Sarne, Yonatan Aumann Tractable (Simple) Contests. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Double Auctions in Markets for Multiple Kinds of Goods. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann MUDA: A Truthful Multi-Unit Double-Auction Mechanism. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Amos Azaria, David Sarne, Yonatan Aumann Distributed Matching with Mixed Maximum-Minimum Utilities. Search on Bibsonomy ACM Trans. Economics and Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Jérôme Lang, Ariel D. Procaccia Fair Division (Dagstuhl Seminar 16232). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Orit Arzi, Yonatan Aumann, Yair Dombb Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann A Random-Sampling Double-Auction Mechanism. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Demand-Flow of Agents with Gross-Substitute Valuations. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann Envy-Free Cake-Cutting in Two Dimensions. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman Efficiency and fairness in team search with self-interested agents. Search on Bibsonomy Autonomous Agents and Multi-Agent Systems The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Demand-flow of agents with gross-substitute valuations. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. Search on Bibsonomy SAGT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann Fair and Square: Cake-Cutting in Two Dimensions. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Yonatan Aumann, Yair Dombb The Efficiency of Fair Division with Connected Pieces. Search on Bibsonomy ACM Trans. Economics and Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yair Dombb, Avinatan Hassidim Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods. Search on Bibsonomy ACM Trans. Economics and Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Envy-Free Cake-Cutting in Two Dimensions. Search on Bibsonomy AAAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. Search on Bibsonomy AAMAS The full citation details ... 2015 DBLP  BibTeX  RDF
1Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Fair and Square: Cake-cutting in Two Dimensions. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1David Sarne, Yonatan Aumann Exploration costs as a means for improving performance in multiagent systems. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Amos Azaria, Yonatan Aumann, Sarit Kraus Automated agents for reward determination for human work in crowdsourcing applications. Search on Bibsonomy Autonomous Agents and Multi-Agent Systems The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yair Dombb, Avinatan Hassidim Auctioning a cake: truthful auctions of heterogeneous divisible goods. Search on Bibsonomy AAMAS The full citation details ... 2014 DBLP  BibTeX  RDF
1Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman Efficiency and fairness in team search with self-interested agents. Search on Bibsonomy AAMAS The full citation details ... 2014 DBLP  BibTeX  RDF
1Noam Hazon, Yonatan Aumann, Sarit Kraus, David Sarne Physical search problems with probabilistic knowledge. Search on Bibsonomy Artif. Intell. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yair Dombb, Avinatan Hassidim Computing socially-efficient cake divisions. Search on Bibsonomy AAMAS The full citation details ... 2013 DBLP  BibTeX  RDF
1Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge On the evaluation of election outcomes under uncertainty. Search on Bibsonomy Artif. Intell. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini Dotted interval graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yair Dombb, Avinatan Hassidim Computing Socially-Efficient Cake Divisions Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko Quasi-distinct parsing and optimal compression methods. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amos Azaria, David Sarne, Yonatan Aumann Distributed Matching with Mixed Maximum-Minimum Utilities. Search on Bibsonomy IAT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amos Azaria, Yonatan Aumann, Sarit Kraus Automated Strategies for Determining Rewards for Human Work. Search on Bibsonomy AAAI The full citation details ... 2012 DBLP  BibTeX  RDF
1David Sarne, Yonatan Aumann The benefits of search costs in multiagent exploration. Search on Bibsonomy AAMAS The full citation details ... 2012 DBLP  BibTeX  RDF
1Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur Finding witnesses by peeling. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Orit Arzi, Yonatan Aumann, Yair Dombb Throw One's Cake --- and Have It Too Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Orit Arzi, Yonatan Aumann, Yair Dombb Throw One's Cake - and Eat It Too. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yehuda Lindell Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. Search on Bibsonomy J. Cryptology The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1David Sarne, Yonatan Aumann Search Costs as a Means for Improving Market Performance. Search on Bibsonomy AMEC/TADA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yair Dombb Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yair Dombb The Efficiency of Fair Division with Connected Pieces. Search on Bibsonomy WINE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tammar Shrot, Yonatan Aumann, Sarit Kraus On agent types in coalition formation problems. Search on Bibsonomy AAMAS The full citation details ... 2010 DBLP  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne Pattern matching with address errors: Rearrangement distances. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat Approximate string matching with address bit errors. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat Efficient computations of l1 and l∞ rearrangement distances. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko Quasi-distinct Parsing and Optimal Compression Methods. Search on Bibsonomy CPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tammar Shrot, Yonatan Aumann, Sarit Kraus Easy and hard coalition resource game formation problems: a parameterized complexity analysis. Search on Bibsonomy AAMAS (1) The full citation details ... 2009 DBLP  BibTeX  RDF coalition problems, parameterized complexity
1Noam Hazon, Yonatan Aumann, Sarit Kraus Collaborative Multi Agent Physical Search with Probabilistic Knowledge. Search on Bibsonomy IJCAI The full citation details ... 2009 DBLP  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat Approximate String Matching with Address Bit Errors. Search on Bibsonomy CPM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sarne Physical Search Problems Applying Economic Search Models. Search on Bibsonomy AAAI The full citation details ... 2008 DBLP  BibTeX  RDF
1Yonatan Aumann, Yair Dombb Fixed Structure Complexity. Search on Bibsonomy IWPEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge Evaluation of election outcomes under uncertainty. Search on Bibsonomy AAMAS (2) The full citation details ... 2008 DBLP  BibTeX  RDF
1Yonatan Aumann, Yehuda Lindell Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2007 DBLP  BibTeX  RDF
1Doron Lipson, Zohar Yakhini, Yonatan Aumann Optimization of probe coverage for high-resolution oligonucleotide aCGH. Search on Bibsonomy Bioinformatics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur Finding Witnesses by Peeling. Search on Bibsonomy CPM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yehuda Lindell Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat Efficient Computations of l1 and linfinity Rearrangement Distances. Search on Bibsonomy SPIRE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. Search on Bibsonomy Journal of Computational Biology The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, Jonathan Schler Visual information extraction. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF PDF analysis, Information extraction, Text analysis, Wrapper induction
1Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat Function Matching. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne Pattern matching with address errors: rearrangement distances. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko Maximal Association Rules: A Tool for Mining Associations in Text. Search on Bibsonomy J. Intell. Inf. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF data mining, association rules, text mining
1Yonatan Aumann, Efrat Manisterski, Zohar Yakhini Designing optimally multiplexed SNP genotyping assays. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Michael A. Bender Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Search on Bibsonomy Distributed Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. Search on Bibsonomy RECOMB The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini Dotted interval graphs and high throughput genotyping. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
1Binyamin Rosenfeld, Ronen Feldman, Moshe Fresko, Jonathan Schler, Yonatan Aumann TEG: a hybrid approach to information extraction. Search on Bibsonomy CIKM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF HMM, information extraction, text mining, rules based system
1Yonatan Aumann, Yehuda Lindell A Statistical Theory for Quantitative Association Rules. Search on Bibsonomy J. Intell. Inf. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Efrat Manisterski, Zohar Yakhini Designing Optimally Multiplexed SNP Genotyping Assays. Search on Bibsonomy WABI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Richard Cole 0001, Moshe Lewenstein, Ely Porat Function Matching: Algorithms, Applications, and a Lower Bound. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF function matching, parameterized matching, Pattern matching, register allocation, protein folding, color indexing
1Yonatan Aumann, Yan Zong Ding, Michael O. Rabin Everlasting security in the bounded storage model. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Ronen Feldman, Yonatan Aumann, Michal Finkelstein-Landau, Eyal Hurvitz, Yizhar Regev, Ariel Yaroshevich A Comparative Study of Information Extraction Strategies. Search on Bibsonomy CICLing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Natural Language Processing, Information Extraction
1Binyamin Rosenfeld, Ronen Feldman, Yonatan Aumann Structural extraction from visual layout of documents. Search on Bibsonomy CIKM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan Linear-Consistency Testing. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Ronen Feldman, Yonatan Aumann, Yair Liberzon, Kfir Ankori, Yonatan Schler, Binyamin Rosenfeld A Domain Independent Environment for Creating Information Extraction Modules. Search on Bibsonomy CIKM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein Pattern Matching with Swaps. Search on Bibsonomy J. Algorithms The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Judit Bar-Ilan, Uriel Feige On the cost of recomputing: Tight bounds on pebbling with faults. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan Linear Consistency Testing Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1999 DBLP  BibTeX  RDF
1Yonatan Aumann, Ronen Feldman, Orly Liphstat, Heikki Mannila Borders: An Efficient Algorithm for Association Generation in Dynamic Databases. Search on Bibsonomy J. Intell. Inf. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Ronen Feldman, Yaron Ben-Yehuda, David Landau, Orly Liphstat, Yonatan Schler Circle Graphs: New Visualization Tools for Text-Mining. Search on Bibsonomy PKDD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Ronen Feldman, Yonatan Aumann, Moshe Fresko, Orly Liphstat, Binyamin Rosenfeld, Yonatan Schler Text Mining via Information Extraction. Search on Bibsonomy PKDD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan Linear Consistency Testing. Search on Bibsonomy RANDOM-APPROX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Avivit Kapah-Levy Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. Search on Bibsonomy SODA The full citation details ... 1999 DBLP  BibTeX  RDF
1Yonatan Aumann, Yehuda Lindell A Statistical Theory for Quantitative Association Rules. Search on Bibsonomy KDD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Michael O. Rabin Information Theoretically Secure Communication in the Limited Storage Space Model. Search on Bibsonomy CRYPTO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yuval Rabani An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1David Landau, Ronen Feldman, Yonatan Aumann, Moshe Fresko, Yehuda Lindell, Orly Liphstat, Oren Zamir TextVis: An Integrated Visual Environment for Text Mining. Search on Bibsonomy PKDD The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Ronen Feldman, Yonatan Aumann, Amir Zilberstein, Yaron Ben-Yehuda Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections. Search on Bibsonomy PKDD The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Ronen Feldman, Moshe Fresko, Haym Hirsh, Yonatan Aumann, Orly Liphstat, Yonatan Schler, Martin Rajman Knowledge Management: A Text Mining Approach. Search on Bibsonomy PAKM The full citation details ... 1998 DBLP  BibTeX  RDF
1Yonatan Aumann, Michael O. Rabin Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). Search on Bibsonomy CRYPTO The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Michael A. Bender, Lisa Zhang Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. Search on Bibsonomy Inf. Comput. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann Efficient Asynchronous Consensus with the Weak Adversary Scheduler. Search on Bibsonomy PODC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Ronen Feldman, Yonatan Aumann, Amihood Amir, Heikki Mannila Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. Search on Bibsonomy DMKD The full citation details ... 1997 DBLP  BibTeX  RDF
1Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein Pattern Matching with Swaps. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF swapped matching, O(mn) time, pattern matching, pattern matching, time complexity, text string
1Ronen 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. Search on Bibsonomy KDD The full citation details ... 1997 DBLP  BibTeX  RDF
1Yonatan Aumann, Michael A. Bender Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. Search on Bibsonomy ICALP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Michael A. Bender Fault Tolerant Data Structures. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF fault tolerant data structures, memory faults, pointer-based data structures, dictionary tree, trees, stack, tree data structures, linked list
Displaying result #1 - #100 of 110 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license