default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYonatan Aumann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j38]Priel Levy, Yonatan Aumann, David Sarne:
Contest partitioning in binary contests. Auton. Agents Multi Agent Syst. 38(1): 7 (2024)- [j37]Priel Levy
, David Sarne, Yonatan Aumann:
Tractable Binary Contests. ACM Trans. Economics and Comput. 12(1): 1:1-1:24 (2024) - [i16]Eden Hartman, Yonatan Aumann, Avinatan Hassidim, Erel Segal-Halevi:
Reducing Leximin Fairness to Utilitarian Optimization. CoRR abs/2409.10395 (2024) - 2023
- [c68]Sarit Kraus, Yaniv Oshrat, Yonatan Aumann, Tal Hollander, Oleg Maksimov, Anita Ostroumov, Natali Shechtman:
Customer Service Combining Human Operators and Virtual Agents: A Call for Multidisciplinary AI Research. AAAI 2023: 15393-15401 - [c67]Dolev Mutzari, Yonatan Aumann, Sarit Kraus:
Resilient Fair Allocation of Indivisible Goods. AAMAS 2023: 2688-2690 - [c66]Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi:
Leximin Approximation: From Single-Objective to Multi-Objective. ECAI 2023: 996-1003 - [i15]Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi:
Leximin Approximation: From Single-Objective to Multi-Objective. CoRR abs/2303.12506 (2023) - 2022
- [c65]Tal Arbiv, Yonatan Aumann:
Fair and Truthful Giveaway Lotteries. AAAI 2022: 4785-4792 - [c64]Dolev Mutzari, Yonatan Aumann, Sarit Kraus:
Robust Solutions for Multi-Defender Stackelberg Security Games. IJCAI 2022: 433-439 - [i14]Dolev Mutzari, Yonatan Aumann, Sarit Kraus:
Robust Solutions for Multi-Defender Stackelberg Security Games. CoRR abs/2204.14000 (2022) - [i13]Yaniv Oshrat, Yonatan Aumann, Tal Hollander, Oleg Maksimov, Anita Ostroumov, Natali Shechtman, Sarit Kraus:
Efficient Customer Service Combining Human Operators and Virtual Agents. CoRR abs/2209.05226 (2022) - 2020
- [j36]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Division of Land. Math. Oper. Res. 45(3): 896-922 (2020)
2010 – 2019
- 2019
- [c63]Priel Levy, David Sarne, Yonatan Aumann:
Selective Information Disclosure in Contests. AAMAS 2019: 2093-2095 - [c62]Michael Gershtein, David Sarne, Yonatan Aumann:
Approval voting with costly information. DAI 2019: 5:1-5:8 - [c61]Priel Levy, David Sarne, Yonatan Aumann:
Temporal Information Design in Contests. IJCAI 2019: 428-434 - 2018
- [c60]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. AAAI 2018: 1193-1201 - [c59]Priel Levy, David Sarne, Yonatan Aumann:
Tractable (Simple) Contests. IJCAI 2018: 361-367 - [c58]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Double Auctions in Markets for Multiple Kinds of Goods. IJCAI 2018: 489-497 - 2017
- [j35]Amos Azaria, David Sarne, Yonatan Aumann:
Distributed Matching with Mixed Maximum-Minimum Utilities. ACM Trans. Economics and Comput. 5(2): 11:1-11:23 (2017) - [i12]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. CoRR abs/1712.06848 (2017) - 2016
- [j34]Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman:
Efficiency and fairness in team search with self-interested agents. Auton. Agents Multi Agent Syst. 30(3): 526-552 (2016) - [j33]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-flow of agents with gross-substitute valuations. Oper. Res. Lett. 44(6): 757-760 (2016) - [j32]Orit Arzi, Yonatan Aumann, Yair Dombb:
Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting. Soc. Choice Welf. 46(4): 933-954 (2016) - [j31]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. ACM Trans. Algorithms 13(1): 12:1-12:32 (2016) - [c57]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. SAGT 2016: 260-272 - [i11]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
A Random-Sampling Double-Auction Mechanism. CoRR abs/1604.06210 (2016) - [i10]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-Flow of Agents with Gross-Substitute Valuations. CoRR abs/1607.01989 (2016) - [i9]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism. CoRR abs/1607.05139 (2016) - [i8]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. CoRR abs/1609.03938 (2016) - [i7]Yonatan Aumann, Jérôme Lang, Ariel D. Procaccia:
Fair Division (Dagstuhl Seminar 16232). Dagstuhl Reports 6(6): 10-25 (2016) - 2015
- [j30]Yonatan Aumann, Yair Dombb:
The Efficiency of Fair Division with Connected Pieces. ACM Trans. Economics and Comput. 3(4): 23:1-23:16 (2015) - [j29]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods. ACM Trans. Economics and Comput. 4(1): 3:1-3:16 (2015) - [c56]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. AAAI 2015: 1021-1028 - [c55]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. AAMAS 2015: 901-908 - [i6]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Fair and Square: Cake-Cutting in Two Dimensions. CoRR abs/1510.03170 (2015) - [i5]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. CoRR abs/1511.02599 (2015) - 2014
- [j28]Amos Azaria, Yonatan Aumann, Sarit Kraus:
Automated agents for reward determination for human work in crowdsourcing applications. Auton. Agents Multi Agent Syst. 28(6): 934-955 (2014) - [j27]David Sarne, Yonatan Aumann:
Exploration costs as a means for improving performance in multiagent systems. Ann. Math. Artif. Intell. 72(3-4): 297-329 (2014) - [c54]Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman:
Efficiency and fairness in team search with self-interested agents. AAMAS 2014: 365-372 - [c53]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Auctioning a cake: truthful auctions of heterogeneous divisible goods. AAMAS 2014: 1045-1052 - 2013
- [j26]Noam Hazon, Yonatan Aumann, Sarit Kraus, David Sarne:
Physical search problems with probabilistic knowledge. Artif. Intell. 196: 26-52 (2013) - [c52]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Computing socially-efficient cake divisions. AAMAS 2013: 343-350 - 2012
- [j25]Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge:
On the evaluation of election outcomes under uncertainty. Artif. Intell. 189: 1-18 (2012) - [j24]Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini:
Dotted interval graphs. ACM Trans. Algorithms 8(2): 9:1-9:21 (2012) - [j23]Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko:
Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422: 1-14 (2012) - [c51]Amos Azaria, Yonatan Aumann, Sarit Kraus:
Automated Strategies for Determining Rewards for Human Work. AAAI 2012: 1514-1521 - [c50]David Sarne, Yonatan Aumann:
The benefits of search costs in multiagent exploration. AAMAS 2012: 1293-1294 - [c49]Amos Azaria, David Sarne, Yonatan Aumann:
Distributed Matching with Mixed Maximum-Minimum Utilities. IAT 2012: 134-139 - [i4]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Computing Socially-Efficient Cake Divisions. CoRR abs/1205.3982 (2012) - 2011
- [j22]Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding witnesses by peeling. ACM Trans. Algorithms 7(2): 24:1-24:15 (2011) - [c48]Orit Arzi, Yonatan Aumann, Yair Dombb:
Throw One's Cake - and Eat It Too. SAGT 2011: 69-80 - [i3]Orit Arzi, Yonatan Aumann, Yair Dombb:
Throw One's Cake --- and Have It Too. CoRR abs/1101.4401 (2011) - 2010
- [j21]Yonatan Aumann, Yehuda Lindell:
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. J. Cryptol. 23(2): 281-343 (2010) - [c47]David Sarne, Yonatan Aumann:
Search Costs as a Means for Improving Market Performance. AMEC/TADA 2010: 76-91 - [c46]Tammar Shrot, Yonatan Aumann, Sarit Kraus:
On agent types in coalition formation problems. AAMAS 2010: 757-764 - [c45]Yonatan Aumann, Yair Dombb:
Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games. SAGT 2010: 66-77 - [c44]Yonatan Aumann, Yair Dombb:
The Efficiency of Fair Division with Connected Pieces. WINE 2010: 26-37
2000 – 2009
- 2009
- [j20]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) - [j19]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient computations of l1 and l∞ rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009) - [j18]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) - [c43]Tammar Shrot, Yonatan Aumann, Sarit Kraus:
Easy and hard coalition resource game formation problems: a parameterized complexity analysis. AAMAS (1) 2009: 433-440 - [c42]Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko:
Quasi-distinct Parsing and Optimal Compression Methods. CPM 2009: 12-25 - [c41]Noam Hazon, Yonatan Aumann, Sarit Kraus:
Collaborative Multi Agent Physical Search with Probabilistic Knowledge. IJCAI 2009: 167-174 - 2008
- [c40]Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sarne:
Physical Search Problems Applying Economic Search Models. AAAI 2008: 9-16 - [c39]Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge:
Evaluation of election outcomes under uncertainty. AAMAS (2) 2008: 959-966 - [c38]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate String Matching with Address Bit Errors. CPM 2008: 118-129 - [c37]Yonatan Aumann, Yair Dombb:
Fixed Structure Complexity. IWPEC 2008: 30-42 - 2007
- [j17]Doron Lipson, Zohar Yakhini, Yonatan Aumann:
Optimization of probe coverage for high-resolution oligonucleotide aCGH. Bioinform. 23(2): 77-83 (2007) - [c36]Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding Witnesses by Peeling. CPM 2007: 28-39 - [c35]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49 - [c34]Yonatan Aumann, Yehuda Lindell:
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. TCC 2007: 137-156 - [i2]Yonatan Aumann, Yehuda Lindell:
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. IACR Cryptol. ePrint Arch. 2007: 60 (2007) - 2006
- [j16]Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini:
Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. J. Comput. Biol. 13(2): 215-228 (2006) - [j15]Yonatan Aumann, Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, Jonathan Schler:
Visual information extraction. Knowl. Inf. Syst. 10(1): 1-15 (2006) - [j14]Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat:
Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006) - [c33]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 - 2005
- [j13]Yonatan Aumann, Michael A. Bender:
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Comput. 17(3): 191-207 (2005) - [j12]Yonatan Aumann, Efrat Manisterski, Zohar Yakhini:
Designing optimally multiplexed SNP genotyping assays. J. Comput. Syst. Sci. 70(3): 399-417 (2005) - [j11]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) - [c32]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 - [c31]Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini:
Dotted interval graphs and high throughput genotyping. SODA 2005: 339-348 - 2004
- [c30]Binyamin Rosenfeld, Ronen Feldman, Moshe Fresko, Jonathan Schler, Yonatan Aumann:
TEG: a hybrid approach to information extraction. CIKM 2004: 589-596 - 2003
- [j10]Yonatan Aumann, Yehuda Lindell:
A Statistical Theory for Quantitative Association Rules. J. Intell. Inf. Syst. 20(3): 255-283 (2003) - [c29]Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat:
Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942 - [c28]Yonatan Aumann, Efrat Manisterski, Zohar Yakhini:
Designing Optimally Multiplexed SNP Genotyping Assays. WABI 2003: 320-338 - 2002
- [j9]Yonatan Aumann, Yan Zong Ding, Michael O. Rabin:
Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory 48(6): 1668-1680 (2002) - [c27]Ronen Feldman, Yonatan Aumann, Michal Finkelstein-Landau, Eyal Hurvitz, Yizhar Regev, Ariel Yaroshevich:
A Comparative Study of Information Extraction Strategies. CICLing 2002: 349-359 - [c26]Binyamin Rosenfeld, Ronen Feldman, Yonatan Aumann:
Structural extraction from visual layout of documents. CIKM 2002: 203-210 - 2001
- [j8]Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan:
Linear-Consistency Testing. J. Comput. Syst. Sci. 62(4): 589-607 (2001) - [c25]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 - 2000
- [j7]Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. J. Algorithms 37(2): 247-266 (2000) - [j6]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)
1990 – 1999
- 1999
- [j5]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) - [c24]Yonatan Aumann, Michael O. Rabin:
Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO 1999: 65-79 - [c23]Yonatan Aumann, Yehuda Lindell:
A Statistical Theory for Quantitative Association Rules. KDD 1999: 261-270 - [c22]Ronen Feldman, Yonatan Aumann, Moshe Fresko, Orly Liphstat, Binyamin Rosenfeld, Yonatan Schler:
Text Mining via Information Extraction. PKDD 1999: 165-173 - [c21]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 - [c20]Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan:
Linear Consistency Testing. RANDOM-APPROX 1999: 109-120 - [c19]Yonatan Aumann, Avivit Kapah-Levy:
Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. SODA 1999: 61-70 - [i1]Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan:
Linear Consistency Testing. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j4]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) - [c18]Yonatan Aumann, Michael O. Rabin:
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). CRYPTO 1998: 299-303 - [c17]Ronen Feldman, Moshe Fresko, Haym Hirsh, Yonatan Aumann, Orly Liphstat, Yonatan Schler, Martin Rajman:
Knowledge Management: A Text Mining Approach. PAKM 1998 - [c16]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 - [c15]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 - 1997
- [j3]Yonatan Aumann, Michael A. Bender, Lisa Zhang:
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. Inf. Comput. 139(1): 1-16 (1997) - [c14]Ronen Feldman, Yonatan Aumann, Amihood Amir, Heikki Mannila:
Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD 1997 - [c13]Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. FOCS 1997: 144-153 - [c12]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 - [c11]Yonatan Aumann:
Efficient Asynchronous Consensus with the Weak Adversary Scheduler. PODC 1997: 209-218 - 1996
- [c10]Yonatan Aumann, Michael A. Bender:
Fault Tolerant Data Structures. FOCS 1996: 580-589 - [c9]Yonatan Aumann, Michael A. Bender:
Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ICALP 1996: 622-633 - [c8]Yonatan Aumann, Michael A. Bender, Lisa Zhang:
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. SPAA 1996: 270-276 - 1995
- [c7]Yonatan Aumann, Yuval Rabani:
Improved Bounds for All Optical Routing. SODA 1995: 567-576 - 1994
- [j2]Yonatan Aumann, Michael O. Rabin:
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. Theor. Comput. Sci. 128(1&2): 3-30 (1994) - [c6]Yonatan Aumann, Judit Bar-Ilan, Uriel Feige:
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. ICALP 1994: 47-58 - 1993
- [b1]Yonatan Aumann:
Computing with low degree networks: shared memory implementation and dynamic Fault-Tolerance (חשוב מקבילי ברשתות דלילות.). Hebrew University of Jerusalem, Israel, 1993 - [c5]Yonatan Aumann, Uriel Feige:
On Message Proof Systems with Known Space Verifiers. CRYPTO 1993: 85-99 - [c4]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
- [c3]Yonatan Aumann, Michael O. Rabin:
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract). FOCS 1992: 147-156 - [c2]Yonatan Aumann, Michael Ben-Or:
Computing with Faulty Arrays. STOC 1992: 162-169 - 1991
- [j1]Yonatan Aumann, Assaf Schuster:
Improved Memory Utilization in Deterministic PRAM Simulation. J. Parallel Distributed Comput. 12(2): 146-151 (1991) - [c1]Yonatan Aumann, Michael Ben-Or:
Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract). FOCS 1991: 440-446
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
