Claus-Peter Schnorr Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Taras Shevchenko: Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction. IACR Cryptology ePrint Archive 2012: 620 (2012)
2011
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Accelerated Slide- and LLL-Reduction. Electronic Colloquium on Computational Complexity (ECCC) 18: 50 (2011)
2008
j47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rupert J. Hartung, Claus-Peter Schnorr: Identification and signatures based on NP-hard problems of indefinite quadratic forms. J. Mathematical Cryptology 2(4): 327-341 (2008)
2007
c55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rupert J. Hartung, Claus-Peter Schnorr: Public Key Identification Based on the Equivalence of Quadratic Forms. MFCS 2007: 333-345
2006
j46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Fast LLL-type lattice reduction. Inf. Comput. 204(1): 1-25 (2006)
j45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Enhancing the security of perfect blind DL-signatures. Inf. Sci. 176(10): 1305-1320 (2006)
2003
c54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Lattice Reduction by Random Sampling and Birthday Methods. STACS 2003: 145-156
2001
j44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys. Inf. Process. Lett. 79(2): 93-98 (2001)
c53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Henrik Koy, Claus-Peter Schnorr: Segment LLL-Reduction of Lattice Bases. CaLC 2001: 67-80
c52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Henrik Koy, Claus-Peter Schnorr: Segment LLL-Reduction with Floating Point Orthogonalization. CaLC 2001: 81-96
c51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Security of Blind Discrete Log Signatures against Interactive Attacks. ICICS 2001: 1-12
c50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Feng Bao, Robert H. Deng, Willi Geiselmann, Claus-Peter Schnorr, Rainer Steinwandt, Hongjun Wu: Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. Public Key Cryptography 2001: 153-164
2000
j43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Roger Fischlin, Claus-Peter Schnorr: Stronger Security Proofs for RSA and Rabin Bits. J. Cryptology 13(2): 221-244 (2000)
c49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Markus Jakobsson: Security of Signed ElGamal Encryption. ASIACRYPT 2000: 73-89
1999
c48no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Markus Jakobsson, Claus-Peter Schnorr: Efficient Oblivious Proofs of Correct Exponentiation. Communications and Multimedia Security 1999: 71-86
1998
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Serge Vaudenay: The Black-Box Model for Cryptographic Primitives. J. Cryptology 11(2): 125-140 (1998)
c47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, C. R. Subramanian: Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). RANDOM 1998: 218-231
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Security of Allmost ALL Discrete Log Bits. Electronic Colloquium on Computational Complexity (ECCC) 5(33) (1998)
1997
c46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Roger Fischlin, Claus-Peter Schnorr: Stronger Security Proofs for RSA and Rabin Bits. EUROCRYPT 1997: 267-279
1996
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Kaib, Claus-Peter Schnorr: The Generalized Gauss Reduction Algorithm. J. Algorithms 21(3): 565-578 (1996)
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Security of 2^t-Root Identification and Signatures. CRYPTO 1996: 143-156
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Carsten Rössner, Claus-Peter Schnorr: An Optimal, Stable Continued Fraction Algorithm. IPCO 1996: 31-43
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Security of 2t-Root Identification and Signatures. Electronic Colloquium on Computational Complexity (ECCC) 3(19) (1996)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Carsten Rössner, Claus-Peter Schnorr: An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension. Electronic Colloquium on Computational Complexity (ECCC) 3(20) (1996)
1995
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Horst Helmut Hörner: Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. EUROCRYPT 1995: 1-12
c42no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Carsten Rössner, Claus-Peter Schnorr: Computation of Highly Regular Nearby Points. ISTCS 1995: 174-181
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Horst Helmut Hörner: Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. Electronic Colloquium on Computational Complexity (ECCC) 2(26) (1995)
1994
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Block Reduced Lattice Bases and Successive Minima. Combinatorics, Probability & Computing 3: 507-522 (1994)
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, M. Euchner: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Program. 66: 181-199 (1994)
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Serge Vaudenay: Black Box Cryptoanalysis of Hash Networks Based on Multipermutations. EUROCRYPT 1994: 47-57
1993
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harald Niederreiter, Claus-Peter Schnorr: Local Randomness in Polynomial Random Number and Random Function Generators. SIAM J. Comput. 22(4): 684-694 (1993)
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Serge Vaudenay: Parallel FFT-Hashing. FSE 1993: 149-156
1992
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern: Improved Low-Density Subset Sum Algorithms. Computational Complexity 2: 111-128 (1992)
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Roland Mirwald, Claus-Peter Schnorr: The Multiplicative Complexity of Quadratic Boolean Forms. Theor. Comput. Sci. 102(2): 307-328 (1992)
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: FFT-Hash II, Efficient Cryptographic Hashing. EUROCRYPT 1992: 45-54
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harald Niederreiter, Claus-Peter Schnorr: Local Randomness in Candidate One-Way Functions. EUROCRYPT 1992: 408-419
1991
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Silvio Micali, Claus-Peter Schnorr: Efficient, Perfect Polynomial Random Number Generators. J. Cryptology 3(3): 157-172 (1991)
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Efficient Signature Generation by Smart Cards. J. Cryptology 4(3): 161-174 (1991)
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. EUROCRYPT 1991: 281-293
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, M. Euchner: Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. FCT 1991: 68-85
1990
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10(4): 333-348 (1990)
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
H. Ong, Claus-Peter Schnorr: Fast Signature Generation With a Fiat Shamir-Like Scheme. EUROCRYPT 1990: 432-440
1989
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr: Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. SIAM J. Comput. 18(5): 859-881 (1989)
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Efficient Identification and Signatures for Smart Cards. CRYPTO 1989: 239-252
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Efficient Identification and Signatures for Smart Cards (Abstract). EUROCRYPT 1989: 688-689
1988
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: A More Efficient Algorithm for Lattice Basis Reduction. J. Algorithms 9(1): 47-62 (1988)
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr: RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Comput. 17(2): 194-209 (1988)
c32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: The Multiplicative Complexity of Boolean Functions. AAECC 1988: 45-58
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Silvio Micali, Claus-Peter Schnorr: Efficient, Perfect Random Number Generators. CRYPTO 1988: 173-198
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: On the Construction of Random Number Generators and Random Function Generators. EUROCRYPT 1988: 225-232
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Geometry of Numbers and Integer Programming (Summary). STACS 1988: 1-7
1987
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber: An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. J. ACM 34(3): 513-531 (1987)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theor. Comput. Sci. 53: 201-224 (1987)
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
John M. Pollard, Claus-Peter Schnorr: An efficient solution of the congruence x2+ky2=mpmod{n}. IEEE Transactions on Information Theory 33(5): 702-709 (1987)
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Roland Mirwald, Claus-Peter Schnorr: The Multiplicative Complexity of Quadratic Boolean Forms. FOCS 1987: 141-150
c27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Azaria Paz, Claus-Peter Schnorr: Approximating Integer Lattices by Lattices with Cyclic Factor Groups. ICALP 1987: 386-393
1986
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). ICALP 1986: 359-369
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. STACS 1986: 105-118
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Adi Shamir: An Optimal Sorting Algorithm for Mesh Connected Computers. STOC 1986: 255-263
1984
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Adi Shamir, Claus-Peter Schnorr: Cryptanalysis of Certain Variants of Rabin's Signature Scheme. Inf. Process. Lett. 19(3): 113-115 (1984)
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
H. Ong, Claus-Peter Schnorr, Adi Shamir: Efficient Signature Schemes Based on Polynomial Equations. CRYPTO 1984: 37-46
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Werner Alexi: RSA-Bits are 0.5 + epsilon Secure. EUROCRYPT 1984: 113-126
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr: RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure. FOCS 1984: 449-457
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
H. Ong, Claus-Peter Schnorr, Adi Shamir: An Efficient Signature Scheme Based on Quadratic Equations. STOC 1984: 208-216
1983
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Jürgen Sattler: Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel. Computing 30(2): 91-110 (1983)
c19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
H. Ong, Claus-Peter Schnorr: Signatures through Approximate Representation by Quadratic Forms. CRYPTO 1983: 117-131
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Monte-Carlo factoring algorithm with finite storage. Theoretical Computer Science 1983: 19-33
1982
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Refined Analysis and Improvements on Some Factoring Algorithms. J. Algorithms 3(2): 101-127 (1982)
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Is the RSA Scheme Safe? EUROCRYPT 1982: 325-329
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jürgen Sattler, Claus-Peter Schnorr: Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel. EUROCRYPT 1982: 331-351
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber: An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs. FOCS 1982: 118-125
1981
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: How Many Polynomials can be Approximated Faster Than They can be Evaluated? Inf. Process. Lett. 12(2): 76-78 (1981)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: An Extension of Strassen's Degree Bound. SIAM J. Comput. 10(2): 371-382 (1981)
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Refined Analysis and Improvements on Some Factoring Algorithms. ICALP 1981: 1-15
1980
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Jean-Paul Van de Wiele: On the Additive Complexity of Polynomials. Theor. Comput. Sci. 10: 1-18 (1980)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: A 3n-Lower Bound on the Network Complexity of Boolean Functions. Theor. Comput. Sci. 10: 83-92 (1980)
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Joos Heintz, Claus-Peter Schnorr: Testing Polynomials which Are Easy to Compute (Extended Abstract). STOC 1980: 262-272
1979
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Bottlenecks and Edge Connectivity in Unsymmetrical Networks. SIAM J. Comput. 8(2): 265-274 (1979)
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: On the Additive Complexity of Polynomials and some New Lower Bounds. Theoretical Computer Science 1979: 286-297
1978
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Satisfiability Is Quasilinear Complete in NQL. J. ACM 25(1): 136-145 (1978)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: An Algorithm for Transitive Closure with Linear Expected Time. SIAM J. Comput. 7(2): 127-133 (1978)
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials. Theor. Comput. Sci. 7: 251-261 (1978)
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. ICALP 1978: 425-439
1977
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, H. Klupp: A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors. Inf. Process. Lett. 6(2): 35-37 (1977)
j14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, P. Fuchs: General Random Sequences and Learnable Sequences. J. Symb. Log. 42(3): 329-340 (1977)
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials. MFCS 1977: 135-147
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: An algorithm for stransitive closure with linear expected time. Theoretical Computer Science 1977: 329-338
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. Reynvaan, Claus-Peter Schnorr: Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen. Theoretical Computer Science 1977: 368-390
1976
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: The Network Complexity and the Turing Machine Complexity of Finite Functions. Acta Inf. 7: 95-107 (1976)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: The Combinational Complexity of Equivalence. Theor. Comput. Sci. 1(4): 289-295 (1976)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: A Lower Bound on the Number of Additions in Monotone Computations. Theor. Comput. Sci. 2(3): 305-315 (1976)
c7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Optimal Algorithms for Self-Reducible Problems. ICALP 1976: 322-337
1975
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Optimal Enumerations and Optimal Gödel Numberings. Mathematical Systems Theory 8(2): 182-191 (1975)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: The network-complexity of equivalence and other applications of the network complexity. Automata Theory and Formal Languages 1975: 83-92
1974
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. Computing 13(2): 155-171 (1974)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: On Maximal Merging of Information in Boolean Computations. ICALP 1974: 294-300
1973
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Process Complexity and Effective Random Tests. J. Comput. Syst. Sci. 7(4): 376-388 (1973)
c4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. MFCS 1973: 153-161
1972
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, H. Stimm: Endliche Automaten und Zufallsfolgen. Acta Inf. 1: 345-359 (1972)
c3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Does the Computational Speed-up Concern Programming? ICALP 1972: 585-591
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: The Process Complexity and Effective Random Tests. STOC 1972: 168-176
1971
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: A Unified Approach to the Definition of Random Sequences. Mathematical Systems Theory 5(3): 246-258 (1971)
c1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Optimal Gödel Numberings. IFIP Congress (1) 1971: 56-58
1969
j5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr, Hermann Walter: Pullbackkonstruktionen bei Semi-Thuesystemen. Elektronische Informationsverarbeitung und Kybernetik 5(1): 27-36 (1969)
j4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Transformational Classes of Grammars. Information and Control 14(3): 252-277 (1969)
j3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Errata: ``Transformational Classes of Grammars''. Information and Control 15(2): 207 (1969)
1968
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen. Computing 3(4): 311-317 (1968)
1967
b1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Darstellbarkeit von Sprachen durch freie assoziative Systeme. Saarland University 1967, pp. 1-78
j1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Claus-Peter Schnorr: Freie assoziative Systeme. Elektronische Informationsverarbeitung und Kybernetik 3(6): 319-340 (1967)

Coauthor Index

1Werner Alexi
[j30] [c22] [c21]
2Feng Bao
[c50]
3Benny Chor
[j30] [c21]
4Matthijs J. Coster
[j37]
5Robert H. Deng (Robert Huijie Deng)
[c50]
6M. Euchner
[j39] [c36]
7Roger Fischlin
[j43] [c46]
8P. Fuchs
[j14]
9Zvi Galil
[j29] [c15]
10Willi Geiselmann
[c50]
11Oded Goldreich
[j30] [c21]
12Rupert J. Hartung
[j47] [c55]
13Joos Heintz
[c13]
14Bettina Helfrich
[c25]
15Christoph M. Hoffmann
[j29] [c15]
16Johan Håstad
[j32] [c25]
17Horst Helmut Hörner
[c43] [i1]
18Markus Jakobsson
[c49] [c48]
19Antoine Joux
[j37]
20Bettina Just
[j32]
21Michael Kaib
[j41]
22H. Klupp
[j15]
23Henrik Koy
[c53] [c52]
24Brian A. LaMacchia
[j37]
25Jeffrey C. Lagarias (J. C. Lagarias)
[j33] [j32] [c25]
26Hendrik W. Lenstra Jr.
[j33]
27Eugene M. Luks
[j29] [c15]
28Silvio Micali
[j35] [c31]
29Roland Mirwald
[j36] [c28]
30Harald Niederreiter
[j38] [c38]
31Andrew M. Odlyzko
[j37]
32H. Ong
[c35] [c23] [c20] [c19]
33Azaria Paz
[c27]
34John M. Pollard
[j27]
35C. Reynvaan
[c8]
36Carsten Rössner
[c44] [i2] [c42]
37Jürgen Sattler
[j25] [c16]
38Adi Shamir
[c24] [j26] [c23] [c20]
39Taras Shevchenko
[i6]
40Rainer Steinwandt
[c50]
41Jacques Stern
[j37]
42H. Stimm
[j7]
43C. R. Subramanian
[c47]
44Serge Vaudenay
[j42] [c41] [c40]
45Hermann Walter
[j5]
46Andreas Weber
[j29] [c15]
47Jean-Paul Van de Wiele
[j21]
48Hongjun Wu
[c50]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Tue May 21 23:40:58 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page