Pages that link to "Item:Q3580947"

The following pages link to Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Q3580947):

Displaying 50 items.

• Approximating the cut-norm via Grothendieck's inequality (Q3580948) (← links)
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (Q3580949) (← links)
• Quantum algorithms a decade after shor (Q3580950) (← links)
• On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (Q3580951) (← links)
• The complexity of pure Nash equilibria (Q3580952) (← links)
• Rational secret sharing and multiparty computation (Q3580953) (← links)
• Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
• A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (Q3580955) (← links)
• Asymmetric k-center is log ^* <i>n</i> -hard to approximate (Q3580956) (← links)
• On the performance of greedy algorithms in packet buffering (Q3580957) (← links)
• Adaptive routing with end-to-end feedback (Q3580958) (← links)
• Know thy neighbor's neighbor (Q3580959) (← links)
• The zero-one principle for switching networks (Q3580960) (← links)
• Dictionary matching and indexing with errors and don't cares (Q3580961) (← links)
• Sorting and searching in the presence of memory faults (without redundancy) (Q3580962) (← links)
• Exponential separation of quantum and classical one-way communication complexity (Q3580963) (← links)
• Approximation algorithm for k-node connected subgraphs via critical graphs (Q3580964) (← links)
• The all-or-nothing multicommodity flow problem (Q3580965) (← links)
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows (Q3580966) (← links)
• Estimating the weight of metric minimum spanning trees in sublinear-time (Q3580967) (← links)
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q3580968) (← links)
• Using nondeterminism to amplify hardness (Q3580969) (← links)
• Visibly pushdown languages (Q3580970) (← links)
• Linear FPT reductions and computational lower bounds (Q3580971) (← links)
• Bounded-concurrent secure multi-party computation with a dishonest majority (Q3580972) (← links)
• Batch codes and their applications (Q3580973) (← links)
• Low distortion maps between point sets (Q3580974) (← links)
• Bypassing the embedding (Q3580975) (← links)
• On coresets for k-means and k-median clustering (Q3580976) (← links)
• Hit-and-run from a corner (Q3580977) (← links)
• Collective asynchronous reading with polylogarithmic worst-case overhead (Q3580978) (← links)
• Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979) (← links)
• Network games (Q3580980) (← links)
• Multi-processor scheduling to minimize flow time with ε resource augmentation (Q3580981) (← links)
• Algorithms for dynamic geometric problems over data streams (Q3580982) (← links)
• Sublinear algorithms for testing monotone and unimodal distributions (Q3580983) (← links)
• The difficulty of testing for isomorphism against a graph that is given in advance (Q3580984) (← links)
• Boosted sampling (Q3580986) (← links)
• Derandomizing homomorphism testing in general groups (Q3580987) (← links)
• Better extractors for better codes? (Q3580988) (← links)
• A new family of Cayley expanders (?) (Q3580989) (← links)
• Lower bounds for local search by quantum arguments (Q3580990) (← links)
• Counting complexity classes for numeric computations II (Q3580991) (← links)
• A conjecture about polynomial time computable lattice-lattice functions (Q3580992) (← links)
• Lower bounds for dynamic connectivity (Q3580993) (← links)
• Depth through breadth, or why should we attend talks in other areas? (Q3580994) (← links)
• Graph entropy and quantum sorting problems (Q3580995) (← links)
• Multilinear formulas and skepticism of quantum computing (Q3580996) (← links)
• New notions of security (Q3580997) (← links)
• Completeness in two-party secure computation (Q3580999) (← links)