Travelled to:1 × France
1 × Germany
1 × Israel
1 × Italy
1 × The Netherlands
1 × United Kingdom
4 × USA
Collaborated with:∅ A.Shamir A.Paz J.Heintz H.Ong
Talks about:algorithm (4) comput (4) lattic (3) network (2) connect (2) factor (2) effici (2) optim (2) test (2) multitermin (1)
Person: Claus-Peter Schnorr
DBLP: Schnorr:Claus=Peter
Contributed to:
19871986
198619841981198019781976197419721972Wrote 11 papers:
- ICALP-1987-PazS #approximate #integer
- Approximating Integer Lattices by Lattices with Cyclic Factor Groups (AP, CPS), pp. 386–393.
- ICALP-1986-Schnorr #algorithm #performance #reduction
- A More Efficient Algorithm for Lattice Basis Reduction (CPS), pp. 359–369.
- STOC-1986-SchnorrS #algorithm #sorting
- An Optimal Sorting Algorithm for Mesh Connected Computers (CPS, AS), pp. 255–263.
- STOC-1984-OngSS #equation #performance #polynomial
- An Efficient Signature Scheme Based on Quadratic Equations (HO, CPS, AS), pp. 208–216.
- ICALP-1981-Schnorr #algorithm #analysis
- Refined Analysis and Improvements on Some Factoring Algorithms (CPS), pp. 1–15.
- STOC-1980-HeintzS #testing
- Testing Polynomials which Are Easy to Compute (JH, CPS), pp. 262–272.
- ICALP-1978-Schnorr #multi #network #symmetry
- Multiterminal Network Flow and Connectivity in Unsymmetrical Networks (CPS), pp. 425–439.
- ICALP-1976-Schnorr #algorithm #problem #self
- Optimal Algorithms for Self-Reducible Problems (CPS), pp. 322–337.
- ICALP-1974-Schnorr #information management #on the
- On Maximal Merging of Information in Boolean Computations (CPS), pp. 294–300.
- ICALP-1972-Schnorr #programming #question
- Does the Computational Speed-up Concern Programming? (CPS), pp. 585–591.
- STOC-1972-Schnorr #complexity #effectiveness #process #random testing #testing
- The Process Complexity and Effective Random Tests (CPS), pp. 168–176.