The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Johan Håstad: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ravi B. Boppana, Johan Håstad, Stathis Zachos
    Does co-NP Have Short Interactive Proofs? [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:2, pp:127-132 [Journal]
  2. Johan Håstad
    On Nontrivial Approximation of CSPs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:1- [Conf]
  3. Johan Håstad, Mats Näslund
    Practical Construction and Analysis of Pseudo-Randomness Primitives. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:442-459 [Conf]
  4. Johan Håstad, Jakob Jonsson, Ari Juels, Moti Yung
    Funkspiel schemes: an alternative to conventional tamper resistance. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2000, pp:125-133 [Conf]
  5. Liming Cai, Jianer Chen, Johan Håstad
    Circuit Bottom Fan-in and Computational Power. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:158-164 [Conf]
  6. Mikael Goldmann, Johan Håstad, Alexander A. Razborov
    Majority Gates vs. General Weighted Threshold Gates. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:2-13 [Conf]
  7. Johan Håstad
    Inapproximability Some history and some open problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:265-0 [Conf]
  8. Johan Håstad, Avi Wigderson
    Simple Analysis of Graph Tests for Linearity and PCP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:244-254 [Conf]
  9. Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway
    Everything Provable is Provable in Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:37-56 [Conf]
  10. Yevgeniy Dodis, Rosario Gennaro, Johan Håstad, Hugo Krawczyk, Tal Rabin
    Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:494-510 [Conf]
  11. Johan Håstad
    On Using RSA with Low Exponent in a Public Key Network. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:403-408 [Conf]
  12. Johan Håstad, Lars Ivansson, Jens Lagergren
    Fitting Points on the Real Line and Its Application to RH Mapping. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:465-476 [Conf]
  13. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
    Simple Constructions of Almost k-Wise Independent Random Variables [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:544-553 [Conf]
  14. William Aiello, Shafi Goldwasser, Johan Håstad
    On the Power of Interaction [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:368-379 [Conf]
  15. William Aiello, Johan Håstad
    Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:439-448 [Conf]
  16. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
    Linearity Testing in Characteristic Two. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:432-441 [Conf]
  17. Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky
    The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:396-407 [Conf]
  18. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
    Hardness of Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:149-158 [Conf]
  19. Johan Håstad
    The shrinkage exponent is 2 [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:114-123 [Conf]
  20. Johan Håstad
    Clique is Hard to Approximate Within n1-epsilon. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:627-636 [Conf]
  21. Johan Håstad, Mikael Goldmann
    On the Power of Small-Depth Threshold Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:610-618 [Conf]
  22. Johan Håstad, Stasys Jukna, Pavel Pudlák
    Top-Down Lower Bounds for Depth 3 Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:124-129 [Conf]
  23. Johan Håstad, Subhash Khot
    Query Efficient PCPs with Perfect Completeness. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:610-619 [Conf]
  24. Johan Håstad, Mats Näslund
    The Security of Individual RSA Bits. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:510-521 [Conf]
  25. Johan Håstad
    Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:235- [Conf]
  26. Johan Håstad
    Tensor Rank is NP-Complete. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:451-460 [Conf]
  27. Johan Håstad, Steven Phillips, Shmuel Safra
    A Well-Characterized Approximation Problem. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:261-265 [Conf]
  28. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear Consistency Testing. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:109-120 [Conf]
  29. Gunnar Andersson, Lars Engebretsen, Johan Håstad
    A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:41-50 [Conf]
  30. 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]
  31. Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
    The complexity of searching a sorted array of strings. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:317-325 [Conf]
  32. Arne Andersson, Johan Håstad, Ola Petersson
    A tight lower bound for searching a sorted array. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:417-426 [Conf]
  33. Paul Beame, Johan Håstad
    Optimal Bounds for Decision Problems on the CRCW PRAM [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:83-93 [Conf]
  34. Mikael Goldmann, Johan Håstad
    Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:569-574 [Conf]
  35. Johan Håstad
    Every 2-CSP allows nontrivial approximation. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:740-746 [Conf]
  36. Johan Håstad
    Almost Optimal Lower Bounds for Small Depth Circuits [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:6-20 [Conf]
  37. Johan Håstad
    Pseudo-Random Generators under Uniform Assumptions [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:395-404 [Conf]
  38. Johan Håstad
    Testing of the Long Code and Hardness for Clique. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:11-19 [Conf]
  39. Johan Håstad
    Some Optimal Inapproximability Results. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:1-10 [Conf]
  40. Johan Håstad, Frank Thomson Leighton, Mark Newman
    Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:274-284 [Conf]
  41. Johan Håstad, Frank Thomson Leighton, Mark Newman
    Fast Computation Using Faulty Hypercubes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:251-263 [Conf]
  42. Johan Håstad, Frank Thomson Leighton, Brian Rogoff
    Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:241-253 [Conf]
  43. Johan Håstad, Adi Shamir
    The Cryptographic Security of Truncated Linearly Related Variables [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:356-362 [Conf]
  44. Johan Håstad, Srinivasan Venkatesh
    On the advantage over a random assignment. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:43-52 [Conf]
  45. Johan Håstad
    Recent Results in Hardness of Approximation. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:231-239 [Conf]
  46. Johan Håstad
    Some Recent Strong Inapproximability Results. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:205-209 [Conf]
  47. Mikael Goldmann, Johan Håstad, Alexander A. Razborov
    Majority Gates VS. General Weighted Threshold Gates. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:277-300 [Journal]
  48. Johan Håstad, Mikael Goldmann
    On the Power of Small-Depth Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1991, v:1, n:, pp:113-129 [Journal]
  49. Johan Håstad, Stasys Jukna, Pavel Pudlák
    Top-Down Lower Bounds for Depth-Three Circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:2, pp:99-112 [Journal]
  50. William Aiello, Shafi Goldwasser, Johan Håstad
    On the power of interaction. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:3-25 [Journal]
  51. Johan Håstad
    Dual vectors and lower bounds for the nearest lattice point problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:75-81 [Journal]
  52. Johan Håstad, Svante Linusson, Johan Wästlund
    A Smaller Sleeping Bag for a Baby Snake. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:173-181 [Journal]
  53. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
    Hardness of approximate hypergraph coloring [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:62, pp:- [Journal]
  54. Johan Håstad
    Some optimal inapproximability results [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:37, pp:- [Journal]
  55. Johan Håstad
    Clique is hard to approximate within n1-epsilon [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:38, pp:- [Journal]
  56. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear Consistency Testing [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:25, pp:- [Journal]
  57. Johan Håstad, Mats Näslund
    The Security of all RSA and Discrete Log Bits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:37, pp:- [Journal]
  58. Johan Håstad
    On approximating CSP-B [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:39, pp:- [Journal]
  59. William Aiello, Johan Håstad
    Relativized Perfect Zero Knowledge Is Not BPP [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:93, n:2, pp:223-240 [Journal]
  60. Johan Håstad, Ingo Wegener, Norbert Wurm, Sang-Zin Yi
    Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC0. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:108, n:2, pp:200-211 [Journal]
  61. Mikael Goldmann, Per Grape, Johan Håstad
    On Average Time Hierarchies. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:1, pp:15-20 [Journal]
  62. Mikael Goldmann, Johan Håstad
    A Simple Lower Bound for Monotone Clique Using a Communication Game. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:4, pp:221-226 [Journal]
  63. Oded Goldreich, Johan Håstad
    On the Complexity of Interactive Proofs with Bounded Communication. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:4, pp:205-214 [Journal]
  64. Johan Håstad
    On bounded occurrence constraint satisfaction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:1-6 [Journal]
  65. Johan Håstad
    One-Way Permutations in NC0. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:3, pp:153-155 [Journal]
  66. Johan Håstad, Steven Phillips, Shmuel Safra
    A Well-Characterized Approximation Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:6, pp:301-305 [Journal]
  67. Paul Beame, Johan Håstad
    Optimal bounds for decision problems on the CRCW PRAM. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:643-670 [Journal]
  68. Johan Håstad
    Some optimal inapproximability results. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:4, pp:798-859 [Journal]
  69. Johan Håstad, Mats Näslund
    The security of all RSA and discrete log bits. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:187-230 [Journal]
  70. Gunnar Andersson, Lars Engebretsen, Johan Håstad
    A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:162-204 [Journal]
  71. Johan Håstad
    Tensor Rank is NP-Complete. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:4, pp:644-654 [Journal]
  72. Johan Håstad, Lars Ivansson, Jens Lagergren
    Fitting points on the real line and its application to RH mapping. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:42-62 [Journal]
  73. William Aiello, Johan Håstad
    Statistical Zero-Knowledge Languages can be Recognized in Two Rounds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:42, n:3, pp:327-345 [Journal]
  74. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear-Consistency Testing. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:4, pp:589-607 [Journal]
  75. Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi
    The Random Oracle Hypothesis Is False. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:1, pp:24-39 [Journal]
  76. Johan Håstad
    A Slight Sharpening of LMN. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:3, pp:498-508 [Journal]
  77. Johan Håstad, A. W. Schrift, Adi Shamir
    The Discrete Logarithm Modulo a Composite Hides O(n) Bits. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:3, pp:376-404 [Journal]
  78. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
    Simple Construction of Almost k-wise Independent Random Variables. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:3, pp:289-304 [Journal]
  79. Noga Alon, Oded Goldreich, Johan Håstad, Rene Paralta
    Addendum to "Simple Construction of Almost k-wise Independent Random Variables". [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:1, pp:119-120 [Journal]
  80. Johan Håstad
    The square lattice shuffle. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:4, pp:466-474 [Journal]
  81. Johan Håstad, Srinivasan Venkatesh
    On the advantage over a random assignment. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:2, pp:117-149 [Journal]
  82. Johan Håstad, Avi Wigderson
    Simple analysis of graph tests for linearity and PCP. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:2, pp:139-160 [Journal]
  83. Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
    Tight Bounds for Searching a Sorted Array of Strings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1552-1578 [Journal]
  84. Liming Cai, Jianer Chen, Johan Håstad
    Circuit Bottom Fan-In and Computational Power. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:341-355 [Journal]
  85. Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir
    Reconstructing Truncated Integer Variables Satisfying Linear Congruences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:262-280 [Journal]
  86. Mikael Goldmann, Johan Håstad
    Monotone Circuits for Connectivity Have Depth (log n)2-o(1). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1283-1294 [Journal]
  87. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
    Hardness of Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1663-1686 [Journal]
  88. Johan Håstad
    Solving Simultaneous Modular Equations of Low Degree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:336-341 [Journal]
  89. Johan Håstad
    The Shrinkage Exponent of de Morgan Formulas is 2. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:48-64 [Journal]
  90. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
    A Pseudorandom Generator from any One-way Function. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1364-1396 [Journal]
  91. 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]
  92. Johan Håstad, Frank Thomson Leighton, Brian Rogoff
    Analysis of Backoff Protocols for Multiple Access Channels. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:4, pp:740-774 [Journal]
  93. Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick
    On Lower Bounds for Selecting the Median. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:299-311 [Journal]
  94. Johan Håstad
    On the Size of Weights for Threshold Gates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:484-492 [Journal]
  95. Johan Håstad, Alexander A. Razborov, Andrew Chi-Chih Yao
    On the Shrinkage Exponent for Read-Once Formulae. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:269-282 [Journal]
  96. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
    Linearity testing in characteristic two. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1781-1795 [Journal]
  97. Venkatesan Guruswami, Johan Håstad, Madhu Sudan, David Zuckerman
    Combinatorial bounds for list decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:5, pp:1021-1034 [Journal]
  98. Johan Håstad
    On the Approximation Resistance of a Random Predicate. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:149-163 [Conf]
  99. Johan Håstad, Svante Linusson, Johan Wästlund
    A Smaller Sleeping Bag for a Baby Snake. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:38, n:1, pp:171- [Journal]
  100. Johan Håstad
    The Security of the IAPM and IACBC Modes. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2007, v:20, n:2, pp:153-163 [Journal]

  101. Approximating Linear Threshold Predicates. [Citation Graph (, )][DBLP]


  102. Towards an optimal separation of space and length in resolution. [Citation Graph (, )][DBLP]


  103. Randomly supported independence and resistance. [Citation Graph (, )][DBLP]


  104. On the list-decodability of random linear codes. [Citation Graph (, )][DBLP]


  105. An Efficient Parallel Repetition Theorem. [Citation Graph (, )][DBLP]


  106. Every 2-csp Allows Nontrivial Approximation. [Citation Graph (, )][DBLP]


  107. On the Approximation Resistance of a Random Predicate. [Citation Graph (, )][DBLP]


  108. Special Issue "Conference on Computational Complexity 2009" Guest Editor's Foreword. [Citation Graph (, )][DBLP]


  109. Towards an Optimal Separation of Space and Length in Resolution [Citation Graph (, )][DBLP]


  110. On the List-Decodability of Random Linear Codes [Citation Graph (, )][DBLP]


  111. Towards an Optimal Separation of Space and Length in Resolution. [Citation Graph (, )][DBLP]


Search in 0.037secs, Finished in 0.042secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002