|
Search the dblp DataBase
Manuel Lameiras Campagnolo:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Daniel S. Graça, Manuel Lameiras Campagnolo, Jorge Buescu
Robust Simulations of Turing Machines with Analytic Maps and Flows. [Citation Graph (0, 0)][DBLP] CiE, 2005, pp:169-179 [Conf]
- Manuel Lameiras Campagnolo, Helder Coelho, Jorge H. Capelo
Knowledge Based Clustering of Partially Characterized Objects. [Citation Graph (0, 0)][DBLP] SBIA, 1995, pp:161-170 [Conf]
- Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. [Citation Graph (0, 0)][DBLP] TAMC, 2006, pp:631-643 [Conf]
- Manuel Lameiras Campagnolo
The Complexity of Real Recursive Functions. [Citation Graph (0, 0)][DBLP] UMC, 2002, pp:1-14 [Conf]
- Manuel Lameiras Campagnolo, Cristopher Moore
Upper and Lower Bounds on Continuous-Time Computation. [Citation Graph (0, 0)][DBLP] UMC, 2000, pp:135-153 [Conf]
- Manuel Lameiras Campagnolo, Kerry Ojakian
The Methods of Approximation and Lifting in Real Computation. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:387-423 [Journal]
- Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa
Iteration, Inequalities, and Differentiability in Analog Computers. [Citation Graph (0, 0)][DBLP] J. Complexity, 2000, v:16, n:4, pp:642-660 [Journal]
- Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa
An Analog Characterization of the Grzegorczyk Hierarchy. [Citation Graph (0, 0)][DBLP] J. Complexity, 2002, v:18, n:4, pp:977-1000 [Journal]
- Manuel Lameiras Campagnolo
Continuous-time computation with restricted integration capabilities. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:317, n:1-3, pp:147-165 [Journal]
- Manuel Lameiras Campagnolo, Kerry Ojakian
Using Approximation to Relate Computational Classes over the Reals. [Citation Graph (0, 0)][DBLP] MCU, 2007, pp:39-61 [Conf]
A Tutorial on Analog Computation: Computing Functions over the Reals. [Citation Graph (, )][DBLP]
The elementary computable functions over the real numbers: applying two new techniques. [Citation Graph (, )][DBLP]
A Survey on Continuous Time Computations [Citation Graph (, )][DBLP]
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs. [Citation Graph (, )][DBLP]
Characterizing Computable Analysis with Differential Equations. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|