Pages that link to "Item:Q2817591"
From MaRDI portal
The following pages link to Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Q2817591):
Displaying 50 items.
- A near optimal algorithm for edge separators (preliminary version) (Q2817592) (← links)
- A randomized linear-time algorithm for finding minimum spanning trees (Q2817593) (← links)
- Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q2817594) (← links)
- On the complexity of negation-limited Boolean networks (Q2817595) (← links)
- On the computational power of depth 2 circuits with threshold and modulo gates (Q2817596) (← links)
- Circuit complexity (Q2817597) (← links)
- A weight-size trade-off for circuits with MOD m gates (Q2817598) (← links)
- Computational geometry (Q2817599) (← links)
- On point location and motion planning among simplices (Q2817600) (← links)
- Fault-tolerant scheduling (Q2817601) (← links)
- On the fault tolerance of the butterfly (Q2817602) (← links)
- Efficient routing in all-optical networks (Q2817603) (← links)
- Scalable expanders (Q2817605) (← links)
- The minimum latency problem (Q2817608) (← links)
- Two prover protocols (Q2817609) (← links)
- Improved non-approximability results (Q2817610) (← links)
- Nearly-linear size holographic proofs (Q2817611) (← links)
- Efficient asynchronous distributed symmetry breaking (Q2817612) (← links)
- Time bounds for mutual exclusion and related problems (Q2817613) (← links)
- Simple and efficient leader election in the full information model (Q2817614) (← links)
- A simple constructive computability theorem for wait-free computation (Q2817615) (← links)
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis (Q2817616) (← links)
- Simulating access to hidden information while learning (Q2817617) (← links)
- On the learnability of discrete distributions (Q2817618) (← links)
- Choosing a learning team (Q2817619) (← links)
- Symmetry breaking for suffix tree construction (Q2817621) (← links)
- Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version) (Q2817622) (← links)
- The complexity of searching a sorted array of strings (Q2817623) (← links)
- Color-coding (Q2817625) (← links)
- Search for the maximum of a random walk (Q2817626) (← links)
- A spectral technique for coloring random 3-colorable graphs (preliminary version) (Q2817627) (← links)
- Pseudorandomness for network algorithms (Q2817628) (← links)
- The complexity of verification (Q2817629) (← links)
- Optimal parallel string algorithms (Q2817630) (← links)
- The independence of the modulo <i>p</i> counting principles (Q2817631) (← links)
- Low degree spanning trees of small weight (Q2817632) (← links)
- .879-approximation algorithms for MAX CUT and MAX 2SAT (Q2817633) (← links)
- An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane (Q2817634) (← links)
- Greed is good (Q2817635) (← links)
- Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) (Q2817636) (← links)
- Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) (Q2817637) (← links)
- Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version) (Q2817638) (← links)
- Pseudorandom generators and learning algorithms for AC (Q2817639) (← links)
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (Q2817640) (← links)
- Derandomization through approximation (Q2817641) (← links)
- On the <i>k</i>-server conjecture (Q2817642) (← links)
- An accelerated interior point method whose running time depends only on A (extended abstract) (Q2817643) (← links)
- How to share a function securely (Q2817644) (← links)
- Computational complexity and knowledge complexity (extended abstract) (Q2817645) (← links)
- Receipt-free secret-ballot elections (extended abstract) (Q2817648) (← links)
