Pages that link to "Item:Q5248465"

The following pages link to Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Q5248465):

Displaying 50 items.

• Some complexity issues on the simply connected regions of the two-dimensional plane (Q5248466) (← links)
• Quantum complexity theory (Q5248467) (← links)
• Thermodynamics of computation and information distance (Q5248468) (← links)
• Fully polynomial Byzantine agreement in <i>t</i> + 1 rounds (Q5248469) (← links)
• Fast asynchronous Byzantine agreement with optimal resilience (Q5248470) (← links)
• Asynchronous secure computation (Q5248471) (← links)
• <i>k</i> one-way heads cannot do string-matching (Q5248472) (← links)
• A theory of parameterized pattern matching (Q5248473) (← links)
• Multiple matching of rectangular patterns (Q5248474) (← links)
• Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations (Q5248475) (← links)
• Wait-free <i>k</i>-set agreement is impossible (Q5248476) (← links)
• The asynchronous computability theorem for <i>t</i>-resilient tasks (Q5248477) (← links)
• Linear programming without the matrix (Q5248478) (← links)
• Comparison-based search in the presence of errors (Q5248479) (← links)
• A robust model for finding optimal evolutionary trees (Q5248480) (← links)
• Maximum <i>k</i>-chains in planar point sets (Q5248481) (← links)
• Lower bounds for randomized mutual exclusion (Q5248482) (← links)
• Competitive distributed file allocation (Q5248483) (← links)
• Contention in shared memory algorithms (Q5248484) (← links)
• What can be computed locally? (Q5248485) (← links)
• Reinventing the wheel (Q5248486) (← links)
• Locality based graph coloring (Q5248487) (← links)
• Separator based sparsification for dynamic planar graph algorithms (Q5248488) (← links)
• Polynomial space polynomial delay algorithms for listing families of graphs (Q5248489) (← links)
• A linear time algorithm for finding tree-decompositions of small treewidth (Q5248490) (← links)
• More deterministic simulation in logspace (Q5248491) (← links)
• Expanders that beat the eigenvalue bound (Q5248492) (← links)
• The biased coin problem (Q5248493) (← links)
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q5248494) (← links)
• Constructing small sample spaces satisfying given constraints (Q5248495) (← links)
• Mapping the genome (Q5248496) (← links)
• On the hardness of approximating minimization problems (Q5248497) (← links)
• Efficient probabilistically checkable proofs and applications to approximations (Q5248498) (← links)
• Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (Q5248499) (← links)
• Efficient learning of typical finite automata from random walks (Q5248500) (← links)
• Finiteness results for sigmoidal “neural” networks (Q5248501) (← links)
• Bounds for the computational power and learning complexity of analog neural nets (Q5248502) (← links)
• Proportionate progress (Q5248503) (← links)
• Self-routing superconcentrators (Q5248504) (← links)
• Space-efficient scheduling of multithreaded computations (Q5248505) (← links)
• Cryptographic hardness of distribution-specific learning (Q5248506) (← links)
• How to use expert advice (Q5248507) (← links)
• Efficient noise-tolerant learning from statistical queries (Q5248508) (← links)
• Online load balancing and network flow (Q5248509) (← links)
• Markov chains, computer proofs, and average-case analysis of best fit bin packing (Q5248510) (← links)
• On-line algorithms for cache sharing (Q5248511) (← links)
• Angles of planar triangular graphs (Q5248512) (← links)
• Many birds with one stone (Q5248513) (← links)
• A parallel approximation algorithm for positive linear programming (Q5248514) (← links)
• Randomness-optimal unique element isolation, with applications to perfect matching and related problems (Q5248515) (← links)