Conferences in DBLP

Randomization and Approximation Techniques in Computer Science (RANDOM) (random)
1997 (conf/random/1997)

1. Marek Karpinski
   Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:1-14 [Conf]
   
2. Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
   Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:15-26 [Conf]
   
3. Christos Levcopoulos, Joachim Gudmundsson
   Approximation Algorithms for Covering Polygons with Squares and Similar Problems. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:27-41 [Conf]
   
4. Bernd Kreuter, Till Nierhoff
   Greedily Approximating the r-independent Set and k-center Problems on Random Instances. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:43-53 [Conf]
   
5. Sanjeev Arora
   Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:55- [Conf]
   
6. Prasad Tetali, Santosh Vempala
   Random Sampling of Euler Tours. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:57-66 [Conf]
   
7. Oded Goldreich, Shmuel Safra
   A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:67-84 [Conf]
   
8. Steven Rudich
   Super-bits, Demi-bits, and NP/qpoly-natural Proofs. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:85-93 [Conf]
   
9. Michael E. Saks, Shiyu Zhou
   Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols. [Citation Graph (0, 0)][DBLP]
   RANDOM, 1997, pp:95-109 [Conf]
   
10. Pierluigi Crescenzi, Viggo Kann
    Approximation on the Web: A Compendium of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:111-118 [Conf]
    
11. Andreas S. Schulz, Martin Skutella
    Random-Based Scheduling: New Approximations and LP Lower Bounds. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:119-133 [Conf]
    
12. Marcus Peinado, Thomas Lengauer
    `Go with the winners' Generators with Applications to Molecular Modeling. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:135-149 [Conf]
    
13. Dawei Hong, Jean-Camille Birget
    Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:151-164 [Conf]
    
14. Russell Impagliazzo
    Using Hard Problems to Derandomize Algorithms: An Incomplete Survey. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:165-173 [Conf]
    
15. Andris Ambainis, Rusins Freivalds, Marek Karpinski
    Weak and Strong Recognition by 2-way Randomized Automata. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:175-185 [Conf]
    
16. Janis Kaneps, Dainis Geidmanis, Rusins Freivalds
    Tally Languages Accepted by Monte Carlo Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:187-195 [Conf]
    
17. Steven M. Kautz
    Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:197-211 [Conf]
    
18. Yongge Wang
    Randomness, Stochasticity and Approximations. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:213-225 [Conf]