Journals in DBLP

Random Struct. Algorithms
1997, volume: 11, number: 4

1. Michael Luby
   Foreword. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:11, n:4, pp:297- [Journal]
   
2. Nabil Kahale
   A semidefinite bound for mixing rates of Markov chains. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:11, n:4, pp:299-313 [Journal]
   
3. Oded Goldreich, Avi Wigderson
   Tiny families of functions with random properties: A quality-size trade-off for hashing. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:11, n:4, pp:315-343 [Journal]
   
4. David Zuckerman
   Randomness-optimal oblivious sampling. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:11, n:4, pp:345-367 [Journal]
   
5. Monika Rauch Henzinger, Mikkel Thorup
   Sampling to provide or to bound: With applications to fully dynamic graph algorithms. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:11, n:4, pp:369-379 [Journal]
   
6. Christoph Dürr, Huong LeThanh, Miklos Santha
   A decision procedure for well-formed linear quantum cellular automata. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:11, n:4, pp:381-394 [Journal]
   
7. Lars Eilstrup Rasmussen
   Approximately counting cliques. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:11, n:4, pp:395-411 [Journal]