PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Schuler, Rainer"

Author of the publication

copydeleteadd this publication to your clipboard
Randomized Quicksort and the Entropy of the Random Number Generator

, , , and . Electronic Colloquium on Computational Complexity (ECCC), (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hon. -Prof. Dr. -Ing. Hans Schuler University of Stuttgart

apl. Prof. Dr. Rainer Bäuerle University of Stuttgart

Rainer Goutrié University of Stuttgart

Dr. Rainer Stöhr University of Stuttgart

Rainer Kuhn University of Stuttgart

 

Other publications of authors with the same name

Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs., and . SAT, volume 2919 of Lecture Notes in Computer Science, page 150-161. Springer, (2003)Random languages for nonuniform complexity classes., and . J. Complexity, 7 (3): 296-310 (1991)The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems., and . ISAAC, volume 2906 of Lecture Notes in Computer Science, page 168-177. Springer, (2003)The Complexity of Generating Test Instances., , and . STACS, volume 1200 of Lecture Notes in Computer Science, page 375-386. Springer, (1997)Universal Distributions and Time-Bounded Kolmogorov Complexity.. STACS, volume 1563 of Lecture Notes in Computer Science, page 434-443. Springer, (1999)A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods., and . WABI, volume 2812 of Lecture Notes in Computer Science, page 55-62. Springer, (2003)Structural Average Case Complexity., and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 128-139. Springer, (1992)Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions.. FSTTCS, volume 1026 of Lecture Notes in Computer Science, page 240-247. Springer, (1995)Randomized Quicksort and the Entropy of the Random Source., , , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 450-460. Springer, (2005)Sets Computable in Polynomial Time on Average., and . COCOON, volume 959 of Lecture Notes in Computer Science, page 400-409. Springer, (1995)