default search action
Louis Theran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Ioannis Gkioulekas, Steven J. Gortler, Louis Theran
, Todd E. Zickler:
Trilateration Using Unlabeled Path or Loop Lengths. Discret. Comput. Geom. 71(2): 399-441 (2024) - 2022
- [j13]Steven J. Gortler, Miranda C. Holmes-Cerfon
Transverse rigidity is prestress stability. Discret. Appl. Math. 322: 439-441 (2022) - [j12]Bernd Schulze, Hattie Serocold, Louis Theran
Frameworks with Coordinated Edge Motions. SIAM J. Discret. Math. 36(4): 2602-2618 (2022) - [i16]Steven J. Gortler, Louis Theran:
Lattices Without a Big Constant and With Noise. CoRR abs/2204.12340 (2022) - 2020
- [j11]Robert Connelly, Steven J. Gortler, Louis Theran
Generically Globally Rigid Graphs Have Generic Universally Rigid Frameworks. Comb. 40(1): 1-37 (2020) - [j10]Zvi Rosen, Jessica Sidman, Louis Theran
Algebraic Matroids in Action. Am. Math. Mon. 127(3): 199-216 (2020)
2010 – 2019
- 2016
- [j9]James Farre, Helena Kleinschmidt, Jessica Sidman, Audrey St. John, Stephanie Stark, Louis Theran
Algorithms for detecting dependencies and rigid subsystems for CAD. Comput. Aided Geom. Des. 47: 130-149 (2016) - 2015
- [j8]Justin Malestein, Louis Theran
Frameworks with Forced Symmetry I: Reflections and Rotations. Discret. Comput. Geom. 54(2): 339-367 (2015) - [j7]Karim A. Adiprasito
Universality Theorems for Inscribed Polytopes and Delaunay Triangulations. Discret. Comput. Geom. 54(2): 412-431 (2015) - [j6]Franz J. Király, Louis Theran, Ryota Tomioka:
The algebraic combinatorial approach for low-rank matrix completion. J. Mach. Learn. Res. 16: 1391-1436 (2015) - 2014
- [c10]Arnau Padrol, Louis Theran:
Delaunay triangulations with disconnected realization spaces. SoCG 2014: 163 - [i15]Franz J. Király, Martin Kreuzer, Louis Theran:
Dual-to-kernel learning with ideals. CoRR abs/1402.0099 (2014) - [i14]Franz J. Király, Louis Theran:
Matroid Regression. CoRR abs/1403.0873 (2014) - [i13]Justin Malestein, Louis Theran:
Ultrarigid periodic frameworks. CoRR abs/1404.2319 (2014) - [i12]Franz J. Király, Martin Kreuzer, Louis Theran:
Learning with Cross-Kernels and Ideal PCA. CoRR abs/1406.2646 (2014) - [i11]Karim A. Adiprasito, Arnau Padrol, Louis Theran:
Universality theorems for inscribed polytopes and Delaunay triangulations. CoRR abs/1406.7831 (2014) - 2013
- [c9]Franz J. Király, Louis Theran:
Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion. NIPS 2013: 2364-2372 - [i10]Franz J. Király, Louis Theran:
Coherence and sufficient sampling densities for reconstruction in compressed sensing. CoRR abs/1302.2767 (2013) - [i9]James Farre, Audrey Lee-St. John, Jessica Sidman, Louis Theran:
Special positions of body-and-cad frameworks. CoRR abs/1306.1572 (2013) - 2012
- [i8]Franz J. Király, Louis Theran, Ryota Tomioka, Takeaki Uno:
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion. CoRR abs/1211.4116 (2012) - 2011
- [j5]Ileana Streinu, Louis Theran:
Natural realizations of sparsity matroids. Ars Math. Contemp. 4(1): 141-151 (2011) - [c8]Matthew Berardi, Brent Heeringa, Justin Malestein, Louis Theran:
Rigid components in fixed-lattice and cone frameworks. CCCG 2011 - [c7]Shiva Prasad Kasiviswanathan, Cristopher Moore
The Rigidity Transition in Random Graphs. SODA 2011: 1237-1252 - [c6]Brent Heeringa, Marius Catalin Iordan, Louis Theran:
Searching in Dynamic Tree-Like Partial Orders. WADS 2011: 512-523 - [i7]Matthew Berardi, Brent Heeringa, Justin Malestein, Louis Theran:
Rigid components in fixed-lattice and cone frameworks. CoRR abs/1105.3234 (2011) - 2010
- [j4]Ileana Streinu, Louis Theran:
Slider-Pinning Rigidity: a Maxwell-Laman-Type Theorem. Discret. Comput. Geom. 44(4): 812-837 (2010) - [i6]Brent Heeringa, Marius Catalin Iordan, Louis Theran:
Searching in Dynamic Tree-Like Partial Orders. CoRR abs/1010.1316 (2010) - [i5]Shiva Prasad Kasiviswanathan, Cristopher Moore, Louis Theran:
The rigidity transition in random graphs. CoRR abs/1010.3605 (2010)
2000 – 2009
- 2009
- [j3]Ileana Streinu, Louis Theran:
Sparse hypergraphs and pebble game algorithms. Eur. J. Comb. 30(8): 1944-1964 (2009) - [j2]Ileana Streinu, Louis Theran:
Sparsity-certifying Graph Decompositions. Graphs Comb. 25(2): 219-238 (2009) - [c5]Louis Theran:
Rigid Components of Random Graphs. CCCG 2009: 63-66 - 2008
- [c4]Audrey Lee, Ileana Streinu, Louis Theran:
Analyzing rigidity with pebble games. SCG 2008: 226-227 - [c3]Ileana Streinu, Louis Theran:
Combinatorial genericity and minimal rigidity. SCG 2008: 365-374 - [i4]Louis Theran:
Rigid Components of Random Graphs. CoRR abs/0812.0872 (2008) - 2007
- [j1]Audrey Lee, Ileana Streinu, Louis Theran:
Graded Sparse Graphs and Matroids. J. Univers. Comput. Sci. 13(11): 1671-1679 (2007) - [c2]Audrey Lee, Ileana Streinu, Louis Theran:
The Slider-Pinning Problem. CCCG 2007: 113-116 - [i3]Ileana Streinu, Louis Theran:
Sparsity-certifying Graph Decompositions. CoRR abs/0704.0002 (2007) - [i2]Ileana Streinu, Louis Theran:
Natural realizations of sparsity matroids. CoRR abs/0711.3013 (2007) - [i1]Ileana Streinu, Louis Theran:
Sparse Hypergraphs and Pebble Game Algorithms. CoRR abs/math/0703921 (2007) - 2005
- [c1]Audrey Lee, Ileana Streinu, Louis Theran:
Finding and Maintaining Rigid Components. CCCG 2005: 219-222
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 23:01 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: