default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArno Eigenwillig
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i2]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:
TF-GNN: Graph Neural Networks in TensorFlow. CoRR abs/2207.03522 (2022)
2010 – 2019
- 2011
- [p2]Arno Eigenwillig, Kurt Mehlhorn:
Multiplication of Long Integers - Faster than Long Multiplication. Algorithms Unplugged 2011: 101-109 - 2010
- [c9]Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, Fabien Viger:
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. ESA (1) 2010: 290-301
2000 – 2009
- 2008
- [b1]Arno Eigenwillig:
Real root isolation for exact and approximate polynomials using Descartes' rule of signs. Saarland University, 2008 - [c8]Arno Eigenwillig, Michael Kerber:
Exact and efficient 2D-arrangements of arbitrary algebraic curves. SODA 2008: 122-131 - [p1]Arno Eigenwillig, Kurt Mehlhorn:
Multiplikation langer Zahlen (schneller als in der Schule). Taschenbuch der Algorithmen 2008: 109-118 - 2007
- [c7]Arno Eigenwillig, Lutz Kettner, Nicola Wolpert:
Snap rounding of Bézier curves. SCG 2007: 158-167 - [c6]Arno Eigenwillig, Michael Kerber, Nicola Wolpert:
Fast and exact geometric analysis of real algebraic plane curves. ISSAC 2007: 151-158 - 2006
- [j1]Arno Eigenwillig, Lutz Kettner, Elmar Schömer
, Nicola Wolpert:
Exact, efficient, and complete arrangement computation for cubic curves. Comput. Geom. 35(1-2): 36-73 (2006) - [c5]Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap:
Almost tight recursion tree bounds for the Descartes method. ISSAC 2006: 71-78 - [i1]Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert:
A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. Reliable Implementation of Real Number Algorithms 2006 - 2005
- [c4]Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert:
A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. CASC 2005: 138-149 - [c3]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert:
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. ESA 2005: 155-166 - 2004
- [c2]Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
Complete, exact, and efficient computations with cubic curves. SCG 2004: 409-418 - 2002
- [c1]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer:
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. ESA 2002: 174-186
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
