We stand with Ukraine

We stand with Ukraine

Louis Theran

Orcid: 0000-0001-5282-4800

According to our database¹, Louis Theran authored at least 32 papers between 2005 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Trilateration Using Unlabeled Path or Loop Lengths.

[BibT_eX]

[DOI]

Ioannis Gkioulekas

,

Steven J. Gortler

,

,

Todd E. Zickler

Discret. Comput. Geom., March, 2024

2022

Frameworks with Coordinated Edge Motions.

[BibT_eX]

[DOI]

,

Hattie Serocold

,

SIAM J. Discret. Math., December, 2022

Transverse rigidity is prestress stability.

[BibT_eX]

[DOI]

Steven J. Gortler

,

Miranda C. Holmes-Cerfon

,

Discret. Appl. Math., 2022

Lattices Without a Big Constant and With Noise.

[BibT_eX]

[DOI]

Steven J. Gortler

,

CoRR, 2022

2020

Algebraic Matroids in Action.

[BibT_eX]

[DOI]

,

,

Am. Math. Mon., 2020

Generically Globally Rigid Graphs Have Generic Universally Rigid Frameworks.

[BibT_eX]

[DOI]

Robert Connelly

,

Steven J. Gortler

,

Comb., 2020

2016

Algorithms for detecting dependencies and rigid subsystems for CAD.

[BibT_eX]

[DOI]

,

Helena Kleinschmidt

,

,

Audrey St. John

,

Stephanie Stark

,

,

Comput. Aided Geom. Des., 2016

2015

The algebraic combinatorial approach for low-rank matrix completion.

[BibT_eX]

[DOI]

Franz J. Király

,

,

J. Mach. Learn. Res., 2015

Frameworks with Forced Symmetry I: Reflections and Rotations.

[BibT_eX]

[DOI]

Justin Malestein

,

Discret. Comput. Geom., 2015

Universality Theorems for Inscribed Polytopes and Delaunay Triangulations.

[BibT_eX]

[DOI]

Karim A. Adiprasito

,

,

Discret. Comput. Geom., 2015

2014

Ultrarigid periodic frameworks.

[BibT_eX]

[DOI]

Justin Malestein

,

CoRR, 2014

Matroid Regression.

[BibT_eX]

[DOI]

Franz J. Király

,

CoRR, 2014

Learning with Cross-Kernels and Ideal PCA.

[BibT_eX]

[DOI]

Franz J. Király

,

,

CoRR, 2014

Dual-to-kernel learning with ideals.

[BibT_eX]

[DOI]

Franz J. Király

,

,

CoRR, 2014

Delaunay triangulations with disconnected realization spaces.

[BibT_eX]

[DOI]

,

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Coherence and sufficient sampling densities for reconstruction in compressed sensing

[BibT_eX]

[DOI]

Franz J. Király

,

CoRR, 2013

Special positions of body-and-cad frameworks.

[BibT_eX]

[DOI]

,

Audrey Lee-St. John

,

,

CoRR, 2013

Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion.

[BibT_eX]

[DOI]

Franz J. Király

,

Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2012

The Algebraic Combinatorial Approach for Low-Rank Matrix Completion

[BibT_eX]

[DOI]

Franz J. Király

,

,

,

CoRR, 2012

2011

Natural realizations of sparsity matroids.

[BibT_eX]

[DOI]

,

Ars Math. Contemp., 2011

Searching in Dynamic Tree-Like Partial Orders.

[BibT_eX]

[DOI]

,

Marius Catalin Iordan

,

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

The Rigidity Transition in Random Graphs.

[BibT_eX]

[DOI]

Shiva Prasad Kasiviswanathan

,

Cristopher Moore

,

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Rigid components in fixed-lattice and cone frameworks.

[BibT_eX]

[DOI]

Matthew Berardi

,

,

Justin Malestein

,

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Slider-Pinning Rigidity: a Maxwell-Laman-Type Theorem.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 2010

2009

Sparsity-certifying Graph Decompositions.

[BibT_eX]

[DOI]

,

Graphs Comb., 2009

Sparse hypergraphs and pebble game algorithms.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2009

Rigid Components of Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Combinatorial genericity and minimal rigidity.

[BibT_eX]

[DOI]

,

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Analyzing rigidity with pebble games.

[BibT_eX]

[DOI]

,

,

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Graded Sparse Graphs and Matroids.

[BibT_eX]

[DOI]

,

,

J. Univers. Comput. Sci., 2007

The Slider-Pinning Problem.

[BibT_eX]

[DOI]

,

,

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2005

Finding and Maintaining Rigid Components.

[BibT_eX]

[DOI]

,

,

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Loading...