default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRainer Schuler
Person information
- affiliation: University of Ulm, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Julian D. Schwab
, Johannes Schobel, Silke D. Werle, Axel Fürstberger, Nensi Ikonomi, Robin Szekely, Patrick Thiam, Rolf Hühne, Niels Jahn, Rainer Schuler, Peter Kuhn, Martin Holderried, Florian Steger, Manfred Reichert, Udo X. Kaisers, Angelika M. R. Kestler, Thomas Seufferlein, Hans A. Kestler:
Perspective on mHealth Concepts to Ensure Users' Empowerment-From Adverse Event Tracking for COVID-19 Vaccinations to Oncological Treatment. IEEE Access 9: 83863-83875 (2021)
2000 – 2009
- 2007
- [j12]Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
Randomized Algorithms for 3-SAT. Theory Comput. Syst. 40(3): 249-262 (2007) - 2005
- [j11]Rainer Schuler:
An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. Algorithms 54(1): 40-44 (2005) - [c21]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized Quicksort and the Entropy of the Random Source. COCOON 2005: 450-460 - 2004
- [j10]Johannes Köbler, Rainer Schuler:
Average-case intractability vs. worst-case intractability. Inf. Comput. 190(1): 1-17 (2004) - [i5]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized QuickSort and the Entropy of the Random Source. Algebraic Methods in Computational Complexity 2004 - [i4]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized Quicksort and the Entropy of the Random Number Generator. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c20]Vikraman Arvind, Rainer Schuler:
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. ISAAC 2003: 168-177 - [c19]Sven Baumer, Rainer Schuler:
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. SAT 2003: 150-161 - [c18]Boris Hollas, Rainer Schuler:
A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods. WABI 2003: 55-62 - [i3]Sven Baumer, Rainer Schuler:
Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j9]Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe:
The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Theory Comput. Syst. 35(4): 449-463 (2002) - [c17]Hubert Hug, Rainer Schuler:
Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules. DNA 2002: 133-142 - [c16]Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
A Probabilistic 3-SAT Algorithm Further Improved. STACS 2002: 192-202 - 2001
- [j8]Hubert Hug, Rainer Schuler:
Strategies for the development of a peptide computer. Bioinform. 17(4): 364-368 (2001) - [c15]Hubert Hug, Rainer Schuler:
DNA-based Parallel Computation of Simple Arithmetic. DNA 2001: 321-328 - [c14]Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe:
On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. STACS 2001: 51-62 - 2000
- [j7]Wolfgang Lindner, Rainer Schuler, Osamu Watanabe:
Resource-Bounded Measure and Learnability. Theory Comput. Syst. 33(2): 151-170 (2000) - [i2]Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe:
On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j6]Christoph Karg, Johannes Köbler, Rainer Schuler:
The Complexity of Generating Test Instances. Chic. J. Theor. Comput. Sci. 1999 (1999) - [c13]Rainer Schuler:
Universal Distributions and Time-Bounded Kolmogorov Complexity. STACS 1999: 434-443 - 1998
- [c12]Wolfgang Lindner, Rainer Schuler, Osamu Watanabe:
Resource Bounded Measure and Learnability. CCC 1998: 261- - [c11]Johannes Köbler, Rainer Schuler:
Average-Case Intractability vs. Worst-Case Intractability. MFCS 1998: 493-502 - [i1]Johannes Köbler, Rainer Schuler:
Average-Case Intractability vs. Worst-Case Intractability. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c10]Rainer Schuler:
A Note on Universal Distributions for Polynomial-Time Computable Distributions. CCC 1997: 69-73 - [c9]Christoph Karg, Johannes Köbler, Rainer Schuler:
The Complexity of Generating Test Instances. STACS 1997: 375-386 - 1996
- [j5]Rainer Schuler, Tomoyuki Yamakami:
Structural Average Case Complexity. J. Comput. Syst. Sci. 52(2): 308-348 (1996) - [c8]Rainer Schuler:
Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. CCC 1996: 190-195 - 1995
- [j4]Vikraman Arvind, Johannes Köbler, Rainer Schuler:
On Helping and Interactive Proof Systems. Int. J. Found. Comput. Sci. 6(2): 137-153 (1995) - [j3]Rainer Schuler:
Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution. Inf. Process. Lett. 55(4): 179-184 (1995) - [j2]Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler:
If NP has Polynomial-Size Circuits, then MA=AM. Theor. Comput. Sci. 137(2): 279-282 (1995) - [c7]Rainer Schuler, Osamu Watanabe:
Towards Average-Case Complexity Analysis of NP Optimization Problems. SCT 1995: 148-159 - [c6]Rainer Schuler, Tomoyuki Yamakami:
Sets Computable in Polynomial Time on Average. COCOON 1995: 400-409 - [c5]Rainer Schuler:
Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions. FSTTCS 1995: 240-247 - [c4]Christoph Karg, Rainer Schuler:
Structure in Average Case Complexity. ISAAC 1995: 62-71 - 1994
- [c3]Vikraman Arvind, Johannes Köbler, Rainer Schuler:
On Helping and Interactive Proof Systems. ISAAC 1994: 137-145 - 1992
- [c2]Rainer Schuler, Tomoyuki Yamakami:
Structural Average Case Complexity. FSTTCS 1992: 128-139 - 1991
- [b1]Rainer Schuler:
Zufall als Ressource für Komplexitätsklassen. University of Ulm, Germany, 1991, pp. 1-88 - [j1]Martin Mundhenk, Rainer Schuler:
Random languages for nonuniform complexity classes. J. Complex. 7(3): 296-310 (1991) - 1990
- [c1]Martin Mundhenk, Rainer Schuler:
Non-Uniform Complexity Classes and Random Languages. SCT 1990: 110-119
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
