Joos Heintz Coauthor index DBLP Vis pubzone.org

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

DBLP keys2010
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost: On the geometry of polar varieties. Appl. Algebra Eng. Commun. Comput. 21(1): 33-83 (2010)
2009
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo: On the intrinsic complexity of point finding in real singular hypersurfaces. Inf. Process. Lett. 109(19): 1141-1144 (2009)
2007
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernd Bank, Max J. Egenhofer, Joos Heintz, Bart Kuijpers, Peter Z. Revesz: 07212 Manifesto -- Constraint Databases, Geometric Elimination ang Geographic Information Systems. Constraint Databases, Geometric Elimination and Geographic Information Systems 2007
2005
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo: Generalized polar varieties: geometry and algorithms. J. Complexity 21(4): 377-412 (2005)
2004
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Bart Kuijpers: Constraint Databases, Data Structures and Efficient Query Evaluation. CDB 2004: 1-24
2003
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLD. Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo: The Hardness of Polynomial Equation Solving. Foundations of Computational Mathematics 3(4): 347-420 (2003)
2001
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Guillermo Matera, Ariel Waissbein: On the Time-Space Complexity of Geometric Elimination Procedures. Appl. Algebra Eng. Commun. Comput. 11(4): 239-296 (2001)
2000
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo: Time-Space Tradeoffs in Algebraic Complexity Theory. J. Complexity 16(1): 2-49 (2000)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Teresa Krick, Susana Puddu, Juan Sabia, Ariel Waissbein: Deformation Techniques for Efficient Polynomial Equation Solving. J. Complexity 16(1): 70-109 (2000)
1999
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernd Bank, Joos Heintz, Lutz Lehmann, Guillermo Matera, Guy M. Mbakop, Rosita Wachenchauzer, Ariel Waissbein: OpTERA - Optimization and Real Equation Solving. German-Argentinian Workshop on Information Technology 1999: 69-72
1998
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo: Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS 1998: 167-175
1997
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernd Bank, Marc Giusti, Joos Heintz, Guy M. Mbakop: Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case. J. Complexity 13(1): 5-27 (1997)
1995
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo: When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC 1995: 205-231
1994
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Marie-Françoise Roy, Pablo Solernó: Description of the Connected Components of a Semialgebraic in Single Exponential Time. Discrete & Computational Geometry 11: 121-140 (1994)
1993
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Marie-Françoise Roy, Pablo Solernó: On the Theoretical and Practical Complexity of the Existential Theory of Reals. Comput. J. 36(5): 427-431 (1993)
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeandro Caniglia, Guillermo Cortiñas, Silvia Danón, Joos Heintz, Teresa Krick, Pablo Solernó: (Working Group Noaï Fitchas) Algorithmic Aspects of Suslin's Proof of Serre's Conjecture. Computational Complexity 3: 31-55 (1993)
20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Giusti, Joos Heintz, Juan Sabia: On the Efficiency of Effective Nullstellensätze. Computational Complexity 3: 56-95 (1993)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Jacques Morgenstern: On the Intrinsic Complexity of Elimination Theory. J. Complexity 9(4): 471-498 (1993)
1991
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeandro Caniglia, André Galligo, Joos Heintz: Equations for the projective closure and effective Nullstellensatz. Discrete Applied Mathematics 33(1-3): 11-23 (1991)
1990
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó: Geometric Problems Solvable in Single Exponential Time. AAECC 1990: 11-23
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Marie-Françoise Roy, Pablo Solernó: Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface. AAECC 1990: 180-196
1989
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Pablo Solernó, Marie-Françoise Roy: On the Complexity of Semialgebraic Sets. IFIP Congress 1989: 293-298
1988
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeandro Caniglia, André Galligo, Joos Heintz: Some New Effectivity Bounds in Computational Geometry. AAECC 1988: 131-151
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJames H. Davenport, Joos Heintz: Real Quantifier Elimination is Doubly Exponential. J. Symb. Comput. 5(1/2): 29-35 (1988)
1987
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz: On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey. AAECC 1987: 269-300
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt: On the Complexity of Lie Algebras. FCT 1987: 172-179
1986
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz: On Polynomials with Symmetric Galois Group which Are Easy to Compute. Theor. Comput. Sci. 47(3): 99-105 (1986)
1985
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans F. de Groote, Joos Heintz: A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. AAECC 1985: 211-222
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz: Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. 39: 343 (1985)
1984
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Jacques Morgenstern: On associative algebras of minimal rank. AAECC 1984: 1-24
1983
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. 24: 239-277 (1983)
1981
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Malte Sieveking: Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. ICALP 1981: 16-28
1980
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Claus-Peter Schnorr: Testing Polynomials which Are Easy to Compute (Extended Abstract) STOC 1980: 262-272
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz, Malte Sieveking: Lower Bounds for Polynomials with Algebraic Coefficients. Theor. Comput. Sci. 11: 321-330 (1980)
1979
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz: A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. Theoretical Computer Science 1979: 153-157
1976
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoos Heintz: Untere Schranken für die Komplexität logischer Entscheidungsprobleme. Komplexität von Entscheidungsproblemen 1976 1976: 127-137

Coauthor Index

1Mikel Aldaz [26] [29]
2Bernd Bank [25] [27] [33] [34] [35] [36]
3Leandro Caniglia [14] [18] [21]
4D. Castro [31]
5Guillermo Cortiñas [21]
6Silvia Danón [21]
7James H. Davenport [13]
8Mohab Safey El Din [36]
9Max J. Egenhofer [34]
10André Galligo [14] [18]
11Marc Giusti [20] [24] [25] [31] [33] [35] [36]
12Hans F. de Groote [9] [11]
13Teresa Krick [17] [21] [28]
14Bart Kuijpers [32] [34]
15Lutz Lehmann [27]
16Guillermo Matera [26] [27] [29] [30] [31]
17Guy M. Mbakop [25] [27]
18Stefan Möhler [11]
19José Luis Montaña (José L. Montaña) [26] [29]
20Jose Enrique Morais [24]
21Jacques Morgenstern [7] [19]
22Luis M. Pardo (Luis Miguel Pardo) [24] [26] [29] [31] [33] [35]
23Susana Puddu [28]
24Peter Z. Revesz [34]
25Marie-Françoise Roy [15] [16] [17] [22] [23]
26Juan Sabia [20] [28]
27Heinz Schmidt [11]
28Claus-Peter Schnorr [4]
29Éric Schost [36]
30Malte Sieveking [3] [5]
31Pablo Solernó [15] [16] [17] [21] [22] [23]
32Rosita Wachenchauzer [27]
33Ariel Waissbein [27] [28] [30]

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)