The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Claus-Peter Schnorr: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Claus-Peter Schnorr
    An Algorithm for Transitive Closure with Linear Expected Time. [Citation Graph (13, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:2, pp:127-133 [Journal]
  2. Claus-Peter Schnorr
    The Multiplicative Complexity of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    AAECC, 1988, pp:45-58 [Conf]
  3. Claus-Peter Schnorr, Markus Jakobsson
    Security of Signed ElGamal Encryption. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2000, pp:73-89 [Conf]
  4. Claus-Peter Schnorr
    The network-complexity of equivalence and other applications of the network complexity. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:83-92 [Conf]
  5. Henrik Koy, Claus-Peter Schnorr
    Segment LLL-Reduction of Lattice Bases. [Citation Graph (0, 0)][DBLP]
    CaLC, 2001, pp:67-80 [Conf]
  6. Henrik Koy, Claus-Peter Schnorr
    Segment LLL-Reduction with Floating Point Orthogonalization. [Citation Graph (0, 0)][DBLP]
    CaLC, 2001, pp:81-96 [Conf]
  7. Markus Jakobsson, Claus-Peter Schnorr
    Efficient Oblivious Proofs of Correct Exponentiation. [Citation Graph (0, 0)][DBLP]
    Communications and Multimedia Security, 1999, pp:71-86 [Conf]
  8. Silvio Micali, Claus-Peter Schnorr
    Efficient, Perfect Random Number Generators. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:173-198 [Conf]
  9. H. Ong, Claus-Peter Schnorr, Adi Shamir
    Efficient Signature Schemes Based on Polynomial Equations. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:37-46 [Conf]
  10. Claus-Peter Schnorr
    Efficient Identification and Signatures for Smart Cards. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:239-252 [Conf]
  11. Claus-Peter Schnorr
    Security of 2^t-Root Identification and Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1996, pp:143-156 [Conf]
  12. H. Ong, Claus-Peter Schnorr
    Signatures through Approximate Representation by Quadratic Forms. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:117-131 [Conf]
  13. Roger Fischlin, Claus-Peter Schnorr
    Stronger Security Proofs for RSA and Rabin Bits. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1997, pp:267-279 [Conf]
  14. Harald Niederreiter, Claus-Peter Schnorr
    Local Randomness in Candidate One-Way Functions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:408-419 [Conf]
  15. H. Ong, Claus-Peter Schnorr
    Fast Signature Generation With a Fiat Shamir-Like Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:432-440 [Conf]
  16. Claus-Peter Schnorr, Serge Vaudenay
    Black Box Cryptoanalysis of Hash Networks Based on Multipermutations. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1994, pp:47-57 [Conf]
  17. Claus-Peter Schnorr
    Is the RSA Scheme Safe? [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1982, pp:325-329 [Conf]
  18. Claus-Peter Schnorr
    On the Construction of Random Number Generators and Random Function Generators. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1988, pp:225-232 [Conf]
  19. Claus-Peter Schnorr
    Efficient Identification and Signatures for Smart Cards (Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:688-689 [Conf]
  20. Claus-Peter Schnorr
    Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:281-293 [Conf]
  21. Jürgen Sattler, Claus-Peter Schnorr
    Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1982, pp:331-351 [Conf]
  22. Claus-Peter Schnorr
    FFT-Hash II, Efficient Cryptographic Hashing. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:45-54 [Conf]
  23. Claus-Peter Schnorr, Werner Alexi
    RSA-Bits are 0.5 + epsilon Secure. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1984, pp:113-126 [Conf]
  24. Claus-Peter Schnorr, Horst Helmut Hörner
    Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1995, pp:1-12 [Conf]
  25. Claus-Peter Schnorr, M. Euchner
    Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:68-85 [Conf]
  26. Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
    RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:449-457 [Conf]
  27. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:118-125 [Conf]
  28. Roland Mirwald, Claus-Peter Schnorr
    The Multiplicative Complexity of Quadratic Boolean Forms [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:141-150 [Conf]
  29. Claus-Peter Schnorr, Serge Vaudenay
    Parallel FFT-Hashing. [Citation Graph (0, 0)][DBLP]
    Fast Software Encryption, 1993, pp:149-156 [Conf]
  30. Azaria Paz, Claus-Peter Schnorr
    Approximating Integer Lattices by Lattices with Cyclic Factor Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:386-393 [Conf]
  31. Claus-Peter Schnorr
    Does the Computational Speed-up Concern Programming? [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:585-591 [Conf]
  32. Claus-Peter Schnorr
    On Maximal Merging of Information in Boolean Computations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:294-300 [Conf]
  33. Claus-Peter Schnorr
    Optimal Algorithms for Self-Reducible Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:322-337 [Conf]
  34. Claus-Peter Schnorr
    Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:425-439 [Conf]
  35. Claus-Peter Schnorr
    Refined Analysis and Improvements on Some Factoring Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:1-15 [Conf]
  36. Claus-Peter Schnorr
    A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:359-369 [Conf]
  37. Claus-Peter Schnorr
    Security of Blind Discrete Log Signatures against Interactive Attacks. [Citation Graph (0, 0)][DBLP]
    ICICS, 2001, pp:1-12 [Conf]
  38. Claus-Peter Schnorr
    Optimal Gödel Numberings. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1971, pp:56-58 [Conf]
  39. Carsten Rössner, Claus-Peter Schnorr
    An Optimal, Stable Continued Fraction Algorithm. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:31-43 [Conf]
  40. Carsten Rössner, Claus-Peter Schnorr
    Computation of Highly Regular Nearby Points. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:174-181 [Conf]
  41. Claus-Peter Schnorr
    Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:153-161 [Conf]
  42. Claus-Peter Schnorr
    Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:135-147 [Conf]
  43. Feng Bao, Robert H. Deng, Willi Geiselmann, Claus-Peter Schnorr, Rainer Steinwandt, Hongjun Wu
    Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2001, pp:153-164 [Conf]
  44. Claus-Peter Schnorr, C. R. Subramanian
    Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:218-231 [Conf]
  45. Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr
    Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:105-118 [Conf]
  46. Claus-Peter Schnorr
    Lattice Reduction by Random Sampling and Birthday Methods. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:145-156 [Conf]
  47. Claus-Peter Schnorr
    Geometry of Numbers and Integer Programming (Summary). [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:1-7 [Conf]
  48. Joos Heintz, Claus-Peter Schnorr
    Testing Polynomials which Are Easy to Compute (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:262-272 [Conf]
  49. H. Ong, Claus-Peter Schnorr, Adi Shamir
    An Efficient Signature Scheme Based on Quadratic Equations [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:208-216 [Conf]
  50. Claus-Peter Schnorr
    The Process Complexity and Effective Random Tests [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:168-176 [Conf]
  51. Claus-Peter Schnorr, Adi Shamir
    An Optimal Sorting Algorithm for Mesh Connected Computers [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:255-263 [Conf]
  52. C. Reynvaan, Claus-Peter Schnorr
    Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1977, pp:368-390 [Conf]
  53. Claus-Peter Schnorr
    An algorithm for stransitive closure with linear expected time. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1977, pp:329-338 [Conf]
  54. Claus-Peter Schnorr
    On the Additive Complexity of Polynomials and some New Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:286-297 [Conf]
  55. Claus-Peter Schnorr
    Monte-Carlo factoring algorithm with finite storage. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:19-33 [Conf]
  56. Claus-Peter Schnorr
    The Network Complexity and the Turing Machine Complexity of Finite Functions [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1976, v:7, n:, pp:95-107 [Journal]
  57. Claus-Peter Schnorr, H. Stimm
    Endliche Automaten und Zufallsfolgen [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1972, v:1, n:, pp:345-359 [Journal]
  58. Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern
    Improved Low-Density Subset Sum Algorithms. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:111-128 [Journal]
  59. J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr
    Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:4, pp:333-348 [Journal]
  60. Claus-Peter Schnorr
    Block Reduced Lattice Bases and Successive Minima. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:507-522 [Journal]
  61. Claus-Peter Schnorr, Horst Helmut Hörner
    Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:26, pp:- [Journal]
  62. Claus-Peter Schnorr
    Security of 2t-Root Identification and Signatures [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:19, pp:- [Journal]
  63. Carsten Rössner, Claus-Peter Schnorr
    An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:20, pp:- [Journal]
  64. Claus-Peter Schnorr
    Security of Allmost ALL Discrete Log Bits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:33, pp:- [Journal]
  65. Claus-Peter Schnorr
    Freie assoziative Systeme. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1967, v:3, n:6, pp:319-340 [Journal]
  66. Claus-Peter Schnorr, Hermann Walter
    Pullbackkonstruktionen bei Semi-Thuesystemen. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1969, v:5, n:1, pp:27-36 [Journal]
  67. Claus-Peter Schnorr
    Fast LLL-type lattice reduction. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:1, pp:1-25 [Journal]
  68. Claus-Peter Schnorr
    Transformational Classes of Grammars [Citation Graph (0, 0)][DBLP]
    Information and Control, 1969, v:14, n:3, pp:252-277 [Journal]
  69. Claus-Peter Schnorr
    Errata: ``Transformational Classes of Grammars'' [Citation Graph (0, 0)][DBLP]
    Information and Control, 1969, v:15, n:2, pp:207- [Journal]
  70. Claus-Peter Schnorr
    Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:2, pp:93-98 [Journal]
  71. Claus-Peter Schnorr
    How Many Polynomials can be Approximated Faster Than They can be Evaluated? [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:76-78 [Journal]
  72. Claus-Peter Schnorr, H. Klupp
    A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:2, pp:35-37 [Journal]
  73. Adi Shamir, Claus-Peter Schnorr
    Cryptanalysis of Certain Variants of Rabin's Signature Scheme. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:3, pp:113-115 [Journal]
  74. Claus-Peter Schnorr
    Enhancing the security of perfect blind DL-signatures. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2006, v:176, n:10, pp:1305-1320 [Journal]
  75. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:513-531 [Journal]
  76. Claus-Peter Schnorr
    Satisfiability Is Quasilinear Complete in NQL. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:1, pp:136-145 [Journal]
  77. Michael Kaib, Claus-Peter Schnorr
    The Generalized Gauss Reduction Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:565-578 [Journal]
  78. Claus-Peter Schnorr
    Refined Analysis and Improvements on Some Factoring Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:2, pp:101-127 [Journal]
  79. Claus-Peter Schnorr
    A More Efficient Algorithm for Lattice Basis Reduction. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:1, pp:47-62 [Journal]
  80. Claus-Peter Schnorr
    Process Complexity and Effective Random Tests. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:4, pp:376-388 [Journal]
  81. Roger Fischlin, Claus-Peter Schnorr
    Stronger Security Proofs for RSA and Rabin Bits. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:2, pp:221-244 [Journal]
  82. Silvio Micali, Claus-Peter Schnorr
    Efficient, Perfect Polynomial Random Number Generators. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1991, v:3, n:3, pp:157-172 [Journal]
  83. Claus-Peter Schnorr
    Efficient Signature Generation by Smart Cards. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1991, v:4, n:3, pp:161-174 [Journal]
  84. Claus-Peter Schnorr, Serge Vaudenay
    The Black-Box Model for Cryptographic Primitives. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1998, v:11, n:2, pp:125-140 [Journal]
  85. Claus-Peter Schnorr, P. Fuchs
    General Random Sequences and Learnable Sequences. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1977, v:42, n:3, pp:329-340 [Journal]
  86. Claus-Peter Schnorr, M. Euchner
    Lattice basis reduction: Improved practical algorithms and solving subset sum problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:66, n:, pp:181-199 [Journal]
  87. Claus-Peter Schnorr
    A Unified Approach to the Definition of Random Sequences. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1971, v:5, n:3, pp:246-258 [Journal]
  88. Claus-Peter Schnorr
    Optimal Enumerations and Optimal Gödel Numberings. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1975, v:8, n:2, pp:182-191 [Journal]
  89. Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
    RSA and Rabin Functions: Certain Parts are as Hard as the Whole. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:194-209 [Journal]
  90. Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr
    Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:5, pp:859-881 [Journal]
  91. Harald Niederreiter, Claus-Peter Schnorr
    Local Randomness in Polynomial Random Number and Random Function Generators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:684-694 [Journal]
  92. Claus-Peter Schnorr
    Bottlenecks and Edge Connectivity in Unsymmetrical Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:2, pp:265-274 [Journal]
  93. Claus-Peter Schnorr
    An Extension of Strassen's Degree Bound. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:371-382 [Journal]
  94. Roland Mirwald, Claus-Peter Schnorr
    The Multiplicative Complexity of Quadratic Boolean Forms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:102, n:2, pp:307-328 [Journal]
  95. Claus-Peter Schnorr
    The Combinational Complexity of Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:1, n:4, pp:289-295 [Journal]
  96. Claus-Peter Schnorr
    A Lower Bound on the Number of Additions in Monotone Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:3, pp:305-315 [Journal]
  97. Claus-Peter Schnorr
    Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:7, n:, pp:251-261 [Journal]
  98. Claus-Peter Schnorr
    A 3n-Lower Bound on the Network Complexity of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:83-92 [Journal]
  99. Claus-Peter Schnorr
    A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:201-224 [Journal]
  100. Claus-Peter Schnorr, Jean-Paul Van de Wiele
    On the Additive Complexity of Polynomials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:1-18 [Journal]
  101. John M. Pollard, Claus-Peter Schnorr
    An efficient solution of the congruence x2+ky2=mpmod{n}. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:5, pp:702-709 [Journal]
  102. Rupert J. Hartung, Claus-Peter Schnorr
    Public Key Identification Based on the Equivalence of Quadratic Forms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:333-345 [Conf]

  103. Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel. [Citation Graph (, )][DBLP]


  104. Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen. [Citation Graph (, )][DBLP]


  105. Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. [Citation Graph (, )][DBLP]


Search in 0.059secs, Finished in 0.062secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002