Arno Eigenwillig

According to our database, Arno Eigenwillig authored at least 15 papers between 2002 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

TF-GNN: Graph Neural Networks in TensorFlow.

Oleksandr Ferludin, Arno Eigenwillig, Martin Blais, Dustin Zelle, Jan Pfeifer, Alvaro Sanchez-Gonzalez, Wai Lok Sibon Li, Sami Abu-El-Haija, Peter W. Battaglia, Neslihan Bulut, Jonathan Halcrow, Filipe Miguel Gonçalves de Almeida, Silvio Lattanzi, André Linhares, Brandon A. Mayer, Vahab S. Mirrokni, John Palowitch, Mihir Paradkar, Jennifer She, Anton Tsitsulin, Kevin Villela, Lisa Wang, David Wong, Bryan Perozzi

CoRR, 2022

2011

Multiplication of Long Integers - Faster than Long Multiplication.

Arno Eigenwillig, Kurt Mehlhorn

Proceedings of the Algorithms Unplugged, 2011

2010

Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns.

Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, Fabien Viger

Proceedings of the Algorithms, 2010

2008

Multiplikation langer Zahlen (schneller als in der Schule).

Arno Eigenwillig, Kurt Mehlhorn

Proceedings of the Taschenbuch der Algorithmen, 2008

Real root isolation for exact and approximate polynomials using Descartes' rule of signs.

Arno Eigenwillig

PhD thesis, 2008

Exact and efficient 2D-arrangements of arbitrary algebraic curves.

Arno Eigenwillig, Michael Kerber

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Fast and exact geometric analysis of real algebraic plane curves.

Arno Eigenwillig, Michael Kerber, Nicola Wolpert

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Snap rounding of Bézier curves.

Arno Eigenwillig, Lutz Kettner, Nicola Wolpert

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Exact, efficient, and complete arrangement computation for cubic curves.

Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert

Comput. Geom., 2006

Almost tight recursion tree bounds for the Descartes method.

Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

A Descartes Algorithms for Polynomials with Bit-Stream Coefficients.

Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert

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.

Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert

Proceedings of the Algorithms, 2005

A Descartes Algorithm for Polynomials with Bit-Stream Coefficients.

Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert

Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004

Complete, exact, and efficient computations with cubic curves.

Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2002

A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons.

Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer

Proceedings of the Algorithms, 2002