The following pages link to Yonatan Aumann (Q208758):
Displaying 50 items.
- Physical search problems with probabilistic knowledge (Q360037) (← links)
- Quasi-distinct parsing and optimal compression methods (Q417983) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- Improved memory utilization in deterministic PRAM simulation (Q1177088) (← links)
- Clock construction in fully asynchronous parallel systems and PRAM simulation (Q1330417) (← links)
- Efficient execution of nondeterministic parallel programs on asynchronous systems (Q1383149) (← links)
- On the cost of recomputing: Tight bounds on pebbling with faults (Q1575959) (← links)
- Demand-flow of agents with gross-substitute valuations (Q1709953) (← links)
- On the evaluation of election outcomes under uncertainty (Q1761297) (← links)
- Designing optimally multiplexed SNP genotyping assays (Q1775775) (← links)
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler (Q1953239) (← links)
- Exploration costs as a means for improving performance in multiagent systems (Q2254629) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- Evaluation of the time course of neurotransmitter release from the measured PSC and MPSC (Q2277387) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting (Q2629532) (← links)
- SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism (Q2819464) (← links)
- Dotted interval graphs and high throughput genotyping (Q2921688) (← links)
- Throw One’s Cake — and Eat It Too (Q3095260) (← links)
- Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games (Q3162508) (← links)
- Finding witnesses by peeling (Q3189006) (← links)
- Dotted interval graphs (Q3189050) (← links)
- Envy-Free Division of Land (Q3387907) (← links)
- Fixed Structure Complexity (Q3503576) (← links)
- Finding Witnesses by Peeling (Q3506906) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← links)
- Pattern matching with address errors (Q3581523) (← links)
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries (Q3596377) (← links)
- Quasi-distinct Parsing and Optimal Compression Methods (Q3637102) (← links)
- (Q4230336) (← links)
- (Q4249338) (← links)
- (Q4252273) (← links)
- One message proof systems with known space verifiers (Q4341735) (← links)
- An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (Q4388872) (← links)
- (Q4449230) (← links)
- (Q4472142) (← links)
- Pattern Matching with Swaps (Q4521515) (← links)
- On the cost of recomputing: tight bounds on pebbling with faults (Q4632415) (← links)
- Everlasting security in the bounded storage model (Q4674532) (← links)
- (Q4818871) (← links)
- (Q4886092) (← links)
- Linear consistency testing (Q4941830) (← links)
- (Q4941847) (← links)
- Waste Makes Haste (Q4962648) (← links)
- Efficient asynchronous consensus with the weak adversary scheduler (Q5361484) (← links)
- Function Matching (Q5470723) (← links)
- Research in Computational Molecular Biology (Q5706913) (← links)
- Linear-consistency testing. (Q5946056) (← links)
