| Publication | Date of Publication | Type |
|---|
Envy-Free Division of Land
Mathematics of Operations Research | 2021-01-08 | Paper |
On the cost of recomputing: tight bounds on pebbling with faults
Automata, Languages and Programming | 2019-04-29 | Paper |
Demand-flow of agents with gross-substitute valuations
Operations Research Letters | 2019-01-15 | Paper |
Waste makes haste: bounded time algorithms for envy-free cake cutting with free disposal
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Efficient asynchronous consensus with the weak adversary scheduler
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Fair and square: cake-cutting in two dimensions
Journal of Mathematical Economics | 2017-06-15 | Paper |
SBBA: a strongly-budget-balanced double-auction mechanism
Algorithmic Game Theory | 2016-09-29 | Paper |
Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
Social Choice and Welfare | 2016-07-06 | Paper |
Exploration costs as a means for improving performance in multiagent systems
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
| Dotted interval graphs and high throughput genotyping | 2014-10-13 | Paper |
Dotted interval graphs
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Finding witnesses by peeling
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Physical search problems with probabilistic knowledge
Artificial Intelligence | 2013-08-23 | Paper |
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
Distributed Computing | 2013-06-07 | Paper |
On the evaluation of election outcomes under uncertainty
Artificial Intelligence | 2012-11-15 | Paper |
Quasi-distinct parsing and optimal compression methods
Theoretical Computer Science | 2012-05-14 | Paper |
Throw one's cake -- and eat it too
Algorithmic Game Theory | 2011-10-28 | Paper |
Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
Algorithmic Game Theory | 2010-10-19 | Paper |
Pattern matching with address errors
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Security against covert adversaries: Efficient protocols for realistic adversaries
Journal of Cryptology | 2010-03-01 | Paper |
Approximate string matching with address bit errors
Theoretical Computer Science | 2009-11-18 | Paper |
Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
Theoretical Computer Science | 2009-10-09 | Paper |
Pattern matching with address errors: rearrangement distances
Journal of Computer and System Sciences | 2009-07-24 | Paper |
Quasi-distinct Parsing and Optimal Compression Methods
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Approximate String Matching with Address Bit Errors
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Finding Witnesses by Peeling
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Fixed Structure Complexity
Parameterized and Exact Computation | 2008-06-05 | Paper |
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Theory of Cryptography | 2007-08-30 | Paper |
Function Matching
SIAM Journal on Computing | 2006-06-01 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Everlasting security in the bounded storage model
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Designing optimally multiplexed SNP genotyping assays
Journal of Computer and System Sciences | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2102783 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2079972 (Why is no real title available?) | 2004-08-03 | Paper |
| scientific article; zbMATH DE number 2038765 (Why is no real title available?) | 2004-02-08 | Paper |
Linear-consistency testing.
Journal of Computer and System Sciences | 2002-07-02 | Paper |
| scientific article; zbMATH DE number 1256650 (Why is no real title available?) | 2002-01-17 | Paper |
Pattern Matching with Swaps
Journal of Algorithms | 2000-12-19 | Paper |
| scientific article; zbMATH DE number 1418270 (Why is no real title available?) | 2000-12-18 | Paper |
On the cost of recomputing: Tight bounds on pebbling with faults
Theoretical Computer Science | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1418287 (Why is no real title available?) | 2000-07-26 | Paper |
| scientific article; zbMATH DE number 1302854 (Why is no real title available?) | 2000-03-07 | Paper |
| scientific article; zbMATH DE number 1305392 (Why is no real title available?) | 1999-06-17 | Paper |
Efficient execution of nondeterministic parallel programs on asynchronous systems
Information and Computation | 1998-07-27 | Paper |
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing | 1998-05-10 | Paper |
| scientific article; zbMATH DE number 1024047 (Why is no real title available?) | 1997-12-15 | Paper |
| scientific article; zbMATH DE number 910915 (Why is no real title available?) | 1996-10-21 | Paper |
Clock construction in fully asynchronous parallel systems and PRAM simulation
Theoretical Computer Science | 1995-04-04 | Paper |
Improved memory utilization in deterministic PRAM simulation
Journal of Parallel and Distributed Computing | 1992-06-25 | Paper |
Evaluation of the time course of neurotransmitter release from the measured PSC and MPSC
Bulletin of Mathematical Biology | 1991-01-01 | Paper |
