The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pascal Koiran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pascal Koiran
    Approximating the Volume of Definable Sets. [Citation Graph (2, 0)][DBLP]
    FOCS, 1995, pp:134-141 [Conf]
  2. Pascal Koiran
    VC Dimension in Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:81-85 [Conf]
  3. Pascal Koiran
    Efficient Learning of Continuous Neural Networks. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:348-355 [Conf]
  4. Leonid Gurvits, Pascal Koiran
    Approximation and learning of convex superpositions. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:222-236 [Conf]
  5. Pascal Koiran, Eduardo D. Sontag
    Vapnik-Chervonenkis Dimension of Recurrent Neural Networks. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:223-237 [Conf]
  6. Pascal Koiran
    A Weak Version of the Blum, Shub & Smale model [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:486-495 [Conf]
  7. Pascal Koiran
    Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:36-45 [Conf]
  8. Hervé Fournier, Pascal Koiran
    Lower Bounds Are Not Easier over the Reals: Inside PH. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:832-843 [Conf]
  9. Pascal Koiran, Vincent Nesme, Natacha Portier
    A Quantum Lower Bound for the Query Complexity of Simon's Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1287-1298 [Conf]
  10. Erich Kaltofen, Pascal Koiran
    On the complexity of factoring bivariate supersparse (Lacunary) polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2005, pp:208-215 [Conf]
  11. Erich Kaltofen, Pascal Koiran
    Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:162-168 [Conf]
  12. Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
    Complexity Issues in Neural Network Computations. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:530-543 [Conf]
  13. Pascal Koiran, Sylvain Perifel
    Valiant's Model: From Exponential Sums to Exponential Products. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:596-607 [Conf]
  14. Pascal Koiran, Eduardo D. Sontag
    Neural Networks with Quadratic VC Dimension. [Citation Graph (0, 0)][DBLP]
    NIPS, 1995, pp:197-203 [Conf]
  15. Michel Cosnard, Pascal Koiran
    Relations between Models of Parallel Abstract Machines. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:37-46 [Conf]
  16. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
    The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:479-490 [Conf]
  17. Michel Cosnard, Max H. Garzon, Pascal Koiran
    Computability Properties of Low-dimensional Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:365-373 [Conf]
  18. Pascal Koiran
    Circuits versus Trees in Algebraic Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:35-52 [Conf]
  19. Pascal Koiran, Sylvain Perifel
    VPSPACE and a Transfer Theorem over the Reals. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:417-428 [Conf]
  20. Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther
    On real Turing machines that toss coins. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:335-342 [Conf]
  21. Hervé Fournier, Pascal Koiran
    Are Lower Bounds Easier over the Reals? [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:507-513 [Conf]
  22. Jacques Cohen, Pascal Koiran, Catherine Perrin
    Meta-Level Interpretation of CLP(Lists). [Citation Graph (0, 0)][DBLP]
    WCLP, 1991, pp:457-481 [Conf]
  23. Olivier Chapuis, Pascal Koiran
    Saturation and Stability in the Theory of Computation over the Reals. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:99, n:1-3, pp:1-49 [Journal]
  24. Pascal Koiran, Natacha Portier
    Back-and-forth systems for generic curves and a decision algorithm for the limit theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:111, n:3, pp:257-275 [Journal]
  25. Pascal Koiran
    Valiant's model and the cost of computing integers. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:13, n:3-4, pp:131-146 [Journal]
  26. Pascal Koiran, Eduardo D. Sontag
    Vapnik-Chervonenkis Dimension of Recurrent Neural Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:86, n:1, pp:63-79 [Journal]
  27. Pascal Koiran
    The topological entropy of iterated piecewise affine maps is uncomputable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:351-356 [Journal]
  28. Pascal Koiran
    Valiant's model and the cost of computing integers [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:003, pp:- [Journal]
  29. Pascal Koiran
    VC Dimension in Circuit Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:51, pp:- [Journal]
  30. Alexander L. Chistov, Hervé Fournier, Leonid Gurvits, Pascal Koiran
    Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2003, v:3, n:4, pp:421-427 [Journal]
  31. Felipe Cucker, Pascal Koiran, Martín Matamala
    Complexity and Dimension. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:4, pp:209-212 [Journal]
  32. Pascal Koiran
    Transfer theorems via sign conditions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:2, pp:65-69 [Journal]
  33. Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
    Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1994, v:10, n:1, pp:57-63 [Journal]
  34. Felipe Cucker, Pascal Koiran
    Computing over the Reals with Addition and Order: Higher Complexity Classes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:3, pp:358-376 [Journal]
  35. Jean-Pierre Dedieu, Pascal Koiran
    Guest Editors' Preface. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:3, pp:528- [Journal]
  36. Askold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub
    Guest editors' preface. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:1, pp:4-0 [Journal]
  37. Pascal Koiran
    The Complexity of Local Dimensions for Constructible Sets. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:311-323 [Journal]
  38. Pascal Koiran
    Hilbert's Nullstellensatz Is in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1996, v:12, n:4, pp:273-286 [Journal]
  39. Pascal Koiran
    Elimination of Constants from Machines over Algebraically Closed Fields. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:65-82 [Journal]
  40. Pascal Koiran
    The Real Dimension Problem Is NPR-Complete. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:2, pp:227-238 [Journal]
  41. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
    The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:3, pp:442-462 [Journal]
  42. Leonid Gurvits, Pascal Koiran
    Approximation and Learning of Convex Superpositions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:1, pp:161-170 [Journal]
  43. Pascal Koiran
    A Weak Version of the Blum, Shub, and Smale Model. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:1, pp:177-189 [Journal]
  44. Pascal Koiran, Eduardo D. Sontag
    Neural Networks with Quadratic VC Dimension. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:1, pp:190-198 [Journal]
  45. Felipe Cucker, Pascal Koiran, Steve Smale
    A Polynomial Time Algorithm for Diophantine Equations in One Variable. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:27, n:1, pp:21-29 [Journal]
  46. Harm Derksen, Emmanuel Jeandel, Pascal Koiran
    Quantum automata and algebraic groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2005, v:39, n:3-4, pp:357-371 [Journal]
  47. Olivier Chapuis, Ehud Hrushovski, Pascal Koiran, Bruno Poizat
    La Limite des Theories de Courbes Generiques. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:24-34 [Journal]
  48. Pascal Koiran
    The theory of Liouville functions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2003, v:68, n:2, pp:353-365 [Journal]
  49. Olivier Chapuis, Pascal Koiran
    Definability of Geometric Properties on Algebraically Closed Fields. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1999, v:45, n:, pp:533-550 [Journal]
  50. Pascal Koiran
    On the complexity of approximating mappings using feedforward networks. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1993, v:6, n:5, pp:649-653 [Journal]
  51. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis
    Deciding stability and mortality of piecewise affine dynamical systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:687-696 [Journal]
  52. Pascal Koiran
    Computing over the Reals with Addition and Order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:35-47 [Journal]
  53. Pascal Koiran
    A Family of Universal Recurrent Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:2, pp:473-480 [Journal]
  54. Pascal Koiran
    Elimination of Parameters in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:289-304 [Journal]
  55. Pascal Koiran, Michel Cosnard, Max H. Garzon
    Computability with Low-Dimensional Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:113-128 [Journal]
  56. Pascal Koiran, Cristopher Moore
    Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:210, n:1, pp:217-223 [Journal]
  57. Pascal Koiran
    Decision Versus Evaluation in Algebraic Complexity. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:80-89 [Conf]
  58. Pascal Koiran, Sylvain Perifel
    VPSPACE and a Transfer Theorem over the Complex Field. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:359-370 [Conf]
  59. Laurent Lyaudet, Pascal Koiran, Uffe Flarup
    On the expressive power of planar perfect matching and permanents of bounded treewidth matrices [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  60. Pascal Koiran, Sylvain Perifel
    VPSPACE and a transfer theorem over the complex field [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  61. Pascal Koiran, Sylvain Perifel
    VPSPACE and a Transfer Theorem over the Reals [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  62. Pascal Koiran, Vincent Nesme, Natacha Portier
    A quantum lower bound for the query complexity of Simon's problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  63. Pascal Koiran, Sylvain Perifel
    Interpolation in Valiant's theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  64. Pascal Koiran, Vincent Nesme, Natacha Portier
    The quantum query complexity of the abelian hidden subgroup problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:115-126 [Journal]

  65. A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. [Citation Graph (, )][DBLP]


  66. On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices. [Citation Graph (, )][DBLP]


  67. Expressing a fraction of two determinants as a determinant. [Citation Graph (, )][DBLP]


  68. A Dichotomy Theorem for Polynomial Evaluation. [Citation Graph (, )][DBLP]


  69. The Multivariate Resultant Is NP-hard in Any Characteristic. [Citation Graph (, )][DBLP]


  70. On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. [Citation Graph (, )][DBLP]


  71. Adversary Lower Bounds for Nonadaptive Quantum Algorithms. [Citation Graph (, )][DBLP]


  72. VPSPACE and a Transfer Theorem over the Reals. [Citation Graph (, )][DBLP]


  73. Adversary lower bounds for nonadaptive quantum algorithms [Citation Graph (, )][DBLP]


  74. A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent [Citation Graph (, )][DBLP]


  75. Toward a Dichotomy Theorem for Polynomial Evaluation [Citation Graph (, )][DBLP]


  76. A hitting set construction, with application to arithmetic circuit lower bounds [Citation Graph (, )][DBLP]


  77. The multivariate resultant lies between NP and AM [Citation Graph (, )][DBLP]


  78. Shallow Circuits with High-Powered Inputs [Citation Graph (, )][DBLP]


  79. Arithmetic circuits: the chasm at depth four gets wider [Citation Graph (, )][DBLP]


  80. Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
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