default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürgen Richter-Gebert
Person information
- affiliation: Technical University Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]Frank Reinhold, Christian Schons
, Sarah Scheuerer, Peter Gritzmann, Jürgen Richter-Gebert, Kristina M. Reiss:
Students' coping with the self-regulatory demand of crisis-driven digitalization in university mathematics instruction: do motivational and emotional orientations make a difference? Comput. Hum. Behav. 120: 106732 (2021)
2010 – 2019
- 2018
- [i1]Aaron Montag, Jürgen Richter-Gebert:
Bringing Together Dynamic Geometry Software and the Graphics Processing Unit. CoRR abs/1808.04579 (2018) - 2016
- [c7]Martin von Gagern, Ulrich Kortenkamp, Jürgen Richter-Gebert, Michael Strobel:
CindyJS - Mathematical Visualization on Modern Devices. ICMS 2016: 319-326 - [c6]Martin von Gagern, Jürgen Richter-Gebert:
CindyJS Plugins - Extending the Mathematical Visualization Framework. ICMS 2016: 327-334 - [c5]Aaron Montag, Jürgen Richter-Gebert:
CindyGL: Authoring GPU-Based Interactive Mathematical Content. ICMS 2016: 359-365 - 2015
- [j16]Qingchun Ren, Jürgen Richter-Gebert, Bernd Sturmfels:
Cayley-Bacharach Formulas. Am. Math. Mon. 122(9): 845-854 (2015) - 2011
- [e2]Pascal Schreck, Julien Narboux, Jürgen Richter-Gebert:
Automated Deduction in Geometry - 8th International Workshop, ADG 2010, Munich, Germany, July 22-24, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6877, Springer 2011, ISBN 978-3-642-25069-9 [contents] - 2010
- [c4]Susanne Apel, Jürgen Richter-Gebert:
Cancellation Patterns in Automatic Geometric Theorem Proving. Automated Deduction in Geometry 2010: 1-33
2000 – 2009
- 2009
- [j15]Komei Fukuda, Sonoko Moriyama, Hiroki Nakayama, Jürgen Richter-Gebert:
Every non-Euclidean oriented matroid admits a biquadratic final polynomial. Comb. 29(6): 691-698 (2009) - [j14]Martin von Gagern, Jürgen Richter-Gebert:
Hyperbolization of Euclidean Ornaments. Electron. J. Comb. 16(2) (2009) - [j13]Jürgen Richter-Gebert, Peter Lebmeir:
Diagrams, Tensors and Geometric Reasoning. Discret. Comput. Geom. 42(2): 305-334 (2009) - 2008
- [j12]Peter Lebmeir, Jürgen Richter-Gebert:
Rotations, translations and symmetry detection for complexified curves. Comput. Aided Geom. Des. 25(9): 707-719 (2008) - 2006
- [c3]Peter Lebmeir, Jürgen Richter-Gebert:
Recognition of Computationally Constructed Loci. Automated Deduction in Geometry 2006: 52-67 - 2004
- [j11]Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert:
The complexity of finding small triangulations of convex 3-polytopes. J. Algorithms 50(2): 134-167 (2004) - [r2]Jürgen Richter-Gebert, Günter M. Ziegler:
Oriented Matroids. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 129-151 - [r1]Martin Henk, Jürgen Richter-Gebert, Günter M. Ziegler:
Basic Properties of Convex Polytopes. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 355-382 - 2001
- [e1]Jürgen Richter-Gebert, Dongming Wang:
Automated Deduction in Geometry, Third International Workshop, ADG 2000, Zurich, Switzerland, September 25-27, 2000, Revised Papers. Lecture Notes in Computer Science 2061, Springer 2001, ISBN 3-540-42598-5 [contents] - 2000
- [j10]Alexander Below, Ulrich Brehm, Jesús A. De Loera, Jürgen Richter-Gebert:
Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes. Discret. Comput. Geom. 24(1): 35-48 (2000) - [j9]Jürgen Richter-Gebert:
Finding Small Triangulations of Polytope Boundaries Is Hard. Discret. Comput. Geom. 24(2-3): 503-518 (2000) - [c2]Ulrich Kortenkamp, Jürgen Richter-Gebert:
Decision Complexity in Dynamic Geometry. Automated Deduction in Geometry 2000: 193-198 - [c1]Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert:
Finding minimal triangulations of convex 3-polytopes is NP-hard. SODA 2000: 65-66
1990 – 1999
- 1997
- [j8]Ulrich Kortenkamp, Jürgen Richter-Gebert, Aravamuthan Sarangarajan, Günter M. Ziegler:
Extremal Properties of 0/1-Polytopes. Discret. Comput. Geom. 17(4): 439-448 (1997) - 1995
- [j7]Jürgen Richter-Gebert:
Mechanical Theorem Proving in Projective Geometry. Ann. Math. Artif. Intell. 13(1-2): 139-172 (1995) - 1993
- [j6]Jürgen Richter-Gebert:
Euclideaness and final polynomials. Comb. 13(3): 259-268 (1993) - [j5]Jürgen Richter-Gebert:
Oriented Matroids with Few Mutations. Discret. Comput. Geom. 10: 251-269 (1993) - [j4]Nicolai E. Mnëv, Jürgen Richter-Gebert:
Two Constructions of Oriented Matroids with Disconnected Extension Space. Discret. Comput. Geom. 10: 271-285 (1993) - [j3]Jürgen Richter-Gebert:
Combinatorial Obstructions to the Lifting of Weaving Diagrams. Discret. Comput. Geom. 10: 287-312 (1993) - 1992
- [j2]Jürgen Bokowski, Jürgen Richter-Gebert:
A new Sylvester-Gallai configuration representing the 13-point projective plane in R4. J. Comb. Theory B 54(1): 161-165 (1992) - 1991
- [j1]Jürgen Bokowski, Jürgen Richter-Gebert, Werner Schindler:
On the Distribution of Order Types. Comput. Geom. 1: 127-142 (1991)
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-10-07 21:13 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:
