Arno Eigenwillig

According to our database1, Arno Eigenwillig authored at least 14 papers between 2002 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2011
Multiplication of Long Integers - Faster than Long Multiplication.
Proceedings of the Algorithms Unplugged, 2011

2010
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns.
Proceedings of the Algorithms, 2010

2008
Multiplikation langer Zahlen (schneller als in der Schule).
Proceedings of the Taschenbuch der Algorithmen, 2008

Real root isolation for exact and approximate polynomials using Descartes' rule of signs.
PhD thesis, 2008

Exact and efficient 2D-arrangements of arbitrary algebraic curves.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Fast and exact geometric analysis of real algebraic plane curves.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Snap rounding of Bézier curves.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Exact, efficient, and complete arrangement computation for cubic curves.
Comput. Geom., 2006

Almost tight recursion tree bounds for the Descartes method.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

A Descartes Algorithms for Polynomials with Bit-Stream Coefficients.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

2005
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces.
Proceedings of the Algorithms, 2005

A Descartes Algorithm for Polynomials with Bit-Stream Coefficients.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004
Complete, exact, and efficient computations with cubic curves.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2002
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons.
Proceedings of the Algorithms, 2002


  Loading...