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

Search the dblp DataBase

Title:
Author:
Jacobo Torán: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jacobo Torán
    Succinct Representations of Counting Problems. [Citation Graph (0, 0)][DBLP]
    AAECC, 1988, pp:415-426 [Conf]
  2. Johannes Köbler, Uwe Schöning, Jacobo Torán
    On Counting and Approximation. [Citation Graph (0, 0)][DBLP]
    CAAP, 1988, pp:40-51 [Conf]
  3. Jacobo Torán
    Arthur-Merlin Games and the Problem of Isomorphism Testing. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:495-506 [Conf]
  4. Vikraman Arvind, Jacobo Torán
    Solvable Group Isomorphism. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:91-103 [Conf]
  5. Vikraman Arvind, Jacobo Torán
    A Nonadaptive NC Checker for Permutation Group Intersection. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:204-212 [Conf]
  6. Richard Chang, William I. Gasarch, Jacobo Torán
    On Finding the Number of Graph Automorphisms. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:288-298 [Conf]
  7. Frederic Green, Johannes Köbler, Jacobo Torán
    The Power of the Middle Bit. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:111-117 [Conf]
  8. Birgit Jenner, Pierre McKenzie, Jacobo Torán
    A Note on the Hardness of Tree Isomorphism. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:101-105 [Conf]
  9. Birgit Jenner, Jacobo Torán
    Computing Functions with Parallel Queries to NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:280-291 [Conf]
  10. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with few Accepting Computations and low Sets for PP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:208-215 [Conf]
  11. Antoni Lozano, Jacobo Torán
    On the Nonuniform Complexity on the Graph Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:118-129 [Conf]
  12. Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán
    Efficient Parallel Algorithms for some Tree Layout Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:313-323 [Conf]
  13. Jacobo Torán
    Lower Bounds for Space in Resolution. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:362-373 [Conf]
  14. Antoni Lozano, Jacobo Torán
    On the Non-Uniform Complexity of the Graph Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:245-271 [Conf]
  15. Josep Díaz, Maria J. Serna, Jacobo Torán
    Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:145-156 [Conf]
  16. Carme Àlvarez, Josep Díaz, Jacobo Torán
    Complexity Classes with Complete Problems Between P and NP-C. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:13-24 [Conf]
  17. Jacobo Torán
    On the Hardness of Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:180-186 [Conf]
  18. Jacobo Torán
    A Combinatorial Technique for Separating Counting Complexity Classes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:733-744 [Conf]
  19. Vikraman Arvind, Jacobo Torán
    The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:233-242 [Conf]
  20. Jacobo Torán
    Counting the Number of Solutions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:121-134 [Conf]
  21. Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
    Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:314-323 [Conf]
  22. Vikraman Arvind, Jacobo Torán
    Sparse Sets, Approximable Sets, and Parallel Queries to NP. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:281-290 [Conf]
  23. Juan Luis Esteban, Jacobo Torán
    Space Bounds for Resolution. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:551-560 [Conf]
  24. Johannes Köbler, Uwe Schöning, Jacobo Torán
    Graph Isomorphism is Low for PP. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:401-411 [Conf]
  25. Johannes Köbler, Jacobo Torán
    The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:121-132 [Conf]
  26. Jochen Meßner, Jacobo Torán
    Optimal Proof Systems for Propositional Logic and Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:477-487 [Conf]
  27. Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán
    The MINSUMCUT Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:65-89 [Conf]
  28. Josep Díaz, Maria J. Serna, Jacobo Torán
    Parallel Approximation Schemes for Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:4, pp:387-408 [Journal]
  29. Johannes Köbler, Uwe Schöning, Jacobo Torán
    On Counting and Approximation. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:26, n:4, pp:363-379 [Journal]
  30. Johannes Köbler, Uwe Schöning, Jacobo Torán
    Graph Isomorphism is Low for PP. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:301-330 [Journal]
  31. Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán
    On Finding the Number of Graph Automorphisms. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  32. Vikraman Arvind, Jacobo Torán
    Isomorphism Testing: Perspective and Open Problems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:86, n:, pp:66-84 [Journal]
  33. S. Baumer, Juan Luis Esteban, Jacobo Torán
    Minimally Unsatisfiable CNF Formulas. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:74, n:, pp:190-192 [Journal]
  34. Jacobo Torán
    Space and Width in Propositional Resolution (Column: Computational Complexity). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:83, n:, pp:86-104 [Journal]
  35. Juan Luis Esteban, Jacobo Torán
    A Combinatorial Characterization of Treelike Resolution Space [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:044, pp:- [Journal]
  36. Vikraman Arvind, Jacobo Torán
    Solvable Group Isomorphism is (almost) in NP\cap coNP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:008, pp:- [Journal]
  37. Jochen Meßner, Jacobo Torán
    Optimal proof systems for Propositional Logic and complete sets [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:26, pp:- [Journal]
  38. Vikraman Arvind, Jacobo Torán
    Sparse Sets, Approximable Sets, and Parallel Queries to NP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:27, pp:- [Journal]
  39. Juan Luis Esteban, Jacobo Torán
    Space Bounds for Resolution. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:171, n:1, pp:84-97 [Journal]
  40. Johannes Köbler, Jochen Messner, Jacobo Torán
    Optimal proof systems imply complete sets for promise classes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:71-92 [Journal]
  41. Vikraman Arvind, Jacobo Torán
    Sparse Sets, Approximable Sets, and Parallel Queries to NP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:4, pp:181-188 [Journal]
  42. Juan Luis Esteban, Jacobo Torán
    A combinatorial characterization of treelike resolution space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:6, pp:295-300 [Journal]
  43. Jacobo Torán
    On The Complexity of Computable Real Sequences. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:2, pp:175-180 [Journal]
  44. Jacobo Torán
    Complexity Classes Defined by Counting Quantifiers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:3, pp:753-774 [Journal]
  45. Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
    The Power of the Middle Bit of a #P Function. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:456-467 [Journal]
  46. Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
    Completeness results for graph isomorphism. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:3, pp:549-566 [Journal]
  47. Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
    Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:783- [Journal]
  48. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with Few Accepting Computations and Low Sets for PP. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:272-286 [Journal]
  49. Josep Díaz, Jacobo Torán
    Classes of Bounded Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:1, pp:21-32 [Journal]
  50. Antoni Lozano, Jacobo Torán
    Self-Reducible Sets of Small Sensity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:2, pp:83-100 [Journal]
  51. Jacobo Torán
    On the Hardness of Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:5, pp:1093-1108 [Journal]
  52. Vikraman Arvind, Jacobo Torán
    A nonadaptive NC checker for permutation group intersection. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:597-611 [Journal]
  53. Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán
    Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:267-287 [Journal]
  54. Birgit Jenner, Jacobo Torán
    Computing Functions with Parallel Queries to NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:175-193 [Journal]

  55. A note on the size of Craig Interpolants. [Citation Graph (, )][DBLP]


  56. Reductions to Graph Isomorphism. [Citation Graph (, )][DBLP]


  57. Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. [Citation Graph (, )][DBLP]


  58. Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs [Citation Graph (, )][DBLP]


  59. Reductions to Graph Isomorphism. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.456secs
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