The following pages link to Joan Feigenbaum (Q222779):
Displaying 50 items.
- Incentive-compatible interdomain routing (Q658663) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- Subjective-cost policy routing (Q883998) (← links)
- Secure circuit evaluation. A protocol based on hiding information from an oracle (Q913487) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time (Q1098860) (← links)
- Games, complexity classes, and approximation algorithms. (Q1126837) (← links)
- Equipartitions of graphs (Q1182860) (← links)
- On being incoherent without being very hard (Q1198954) (← links)
- On hiding information from an oracle (Q1263281) (← links)
- A formal framework for evaluating heuristic programs (Q1267764) (← links)
- On coherence, random-self-reducibility, and self-correction (Q1272663) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- Hardness results for multicast cost sharing. (Q1401398) (← links)
- Computing diameter in the streaming and sliding-window models (Q1763145) (← links)
- Approximation and collusion in multicast cost sharing (Q1885423) (← links)
- A BGP-based mechanism for lowest-cost routing (Q1953638) (← links)
- Mechanism design for policy routing (Q2375297) (← links)
- Towards a theory of data entanglement (Q2465624) (← links)
- Computation in a distributed information market (Q2570129) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- (Q2921736) (← links)
- Systematizing Secure Computation for Research and Decision Support (Q2922670) (← links)
- Secure multiparty computation of approximations (Q2944525) (← links)
- Complexity Results for POMSET Languages (Q3136615) (← links)
- Random-Self-Reducibility of Complete Sets (Q3142589) (← links)
- Sharing the cost of muliticast transmissions (preliminary version) (Q3191988) (← links)
- (Q3210168) (← links)
- (Q3359734) (← links)
- (Q3395958) (← links)
- (Q3524723) (← links)
- Graph Distances in the Data-Stream Model (Q3642861) (← links)
- (Q3722414) (← links)
- Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism (Q3738557) (← links)
- (Q3972530) (← links)
- (Q4035167) (← links)
- (Q4035168) (← links)
- (Q4249642) (← links)
- (Q4252382) (← links)
- (Q4259979) (← links)
- (Q4267798) (← links)
- (Q4279564) (← links)
- (Q4279585) (← links)
- (Q4287358) (← links)
- Universal Traversal Sequences (Q4293904) (← links)
- (Q4314042) (← links)
- Random Debaters and the Hardness of Approximating Stochastic Functions (Q4337648) (← links)
- (Q4415250) (← links)
- (Q4535073) (← links)
