dblp.uni-trier.dewww.uni-trier.de

Pascal Koiran Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Vincent D. Blondel [38] [41] [42] [50]
2Olivier Bournez [38] [41] [42]
3Irénée Briquel [75] [77]
4Olivier Chapuis [32] [35] [45]
5Pierre Charbit [69]
6Alexander L. Chistov [48]
7Jacques Cohen [1]
8Michel Cosnard [2] [3] [5] [8] [10]
9Felipe Cucker [12] [14] [25] [33]
10Jean-Pierre Dedieu [36]
11Harm Derksen [51]
12Uffe Flarup [64] [68]
13Hervé Fournier [29] [40] [48]
14Max H. Garzon [5] [8]
15Leonid Gurvits [17] [21] [48]
16Ehud Hrushovski [45]
17Emmanuel Jeandel [50] [51] [69]
18Erich Kaltofen [55] [59] [73]
19Marek Karpinski [14]
20Askold Khovanskii [52]
21Teresa Krick [52]
22Jürgen Landes [70] [71]
23Thomas Lickteig [14]
24Laurent Lyaudet [64] [68]
25Gregorio Malajovich [52]
26Martín Matamala [25]
27Klaus Meer [72]
28Cristopher Moore [31]
29Vincent Nesme [54] [56] [61]
30Christos H. Papadimitriou [41]
31Hélène Paugam-Moisy [2] [10]
32Sylvain Perifel [57] [58] [60] [62] [63] [65] [66] [69] [76]
33Catherine Perrin [1]
34Bruno Poizat [45]
35Natacha Portier [44] [50] [54] [56] [61] [70] [71]
36Steve Smale [33]
37Eduardo D. Sontag [15] [22] [27] [28]
38Stéphan Thomassé [69]
39J. F. Traub (Joseph F. Traub) [52]
40John N. Tsitsiklis [38] [41] [42]
41Kai Werther [14]
42Penghui Yao [70] [71]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)