Florian A. Potra 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 keys2008
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJun Ji, Florian A. Potra: On the probabilistic complexity of finding an approximate solution for linear programming. J. Complexity 24(2): 214-227 (2008)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra: Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path. Math. Program. 111(1-2): 243-272 (2008)
2007
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(ÖnL)-iteration complexity. Math. Program. 110(2): 443-444 (2007)
2006
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra, Xing Liu, Françoise Seillier-Moiseiwitsch, Anindya Roy, Yaming Hang, Mark R. Marten, Babu Raman, Carol Whisnant: Protein Image Alignment via Piecewise Affine Transformations. Journal of Computational Biology 13(3): 614-630 (2006)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra, Xing Liu: Aligning Families of Two-Dimensional Gels by a Combined Multiresolution Forward-Inverse Transformation Approach. Journal of Computational Biology 13(7): 1384-1395 (2006)
2005
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra: The Kantorovich Theorem and interior point methods. Math. Program. 102(1): 47-70 (2005)
2004
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity. Math. Program. 100(2): 317-337 (2004)
2002
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra: The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path. European Journal of Operational Research 143(2): 257-267 (2002)
1996
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge F. Corliss, Andreas Griewank, Petra Henneberger, Gabriella Kirlinger, Florian A. Potra, Hans J. Stetter: High-Order Stiff ODE Solvers via Automatic Differentiation and Rational Prediction. WNAA 1996: 114-125
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra, Rongqin Sheng: Predictor-corrector algorithm for solving P*(k)-matrix LCP from arbitrary positive starting points. Math. Program. 76: 223-244 (1996)
1995
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGötz Alefeld, Florian A. Potra, Yixun Shi: Algorithm 748: Enclosing Zeros of Continuous Functions. ACM Trans. Math. Softw. 21(3): 327-344 (1995)
1994
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra: Efficient Hybrid Algorithms for Finding Zeros of Convex Functions. J. Complexity 10(2): 199-215 (1994)
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian A. Potra: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67: 383-406 (1994)

Coauthor Index

1Götz Alefeld [3]
2George F. Corliss [5]
3Andreas Griewank [5]
4Yaming Hang [10]
5Petra Henneberger [5]
6Jun Ji [13]
7Gabriella Kirlinger [5]
8Xing Liu [9] [10]
9Mark R. Marten [10]
10Babu Raman [10]
11Anindya Roy [10]
12Françoise Seillier-Moiseiwitsch [10]
13Rongqin Sheng [4]
14Yixun Shi [3]
15Hans J. Stetter [5]
16Carol Whisnant [10]

Colors in the list of coauthors

Copyright © Tue Dec 22 17:48:42 2009 by Michael Ley (ley@uni-trier.de)