Meera Sitharam

CoRR, 2024

Characterizing graph-nonedge pairs with single interval Cayley configuration spaces in 3-dimensions.

[BibT_eX]

[DOI]

William Sims

CoRR, 2024

Best of two worlds: Cartesian sampling and volume computation for distance-constrained configuration spaces using Cayley coordinates.

[BibT_eX]

[DOI]

Yichi Zhang

CoRR, 2024

2023

Flip paths between lattice triangulations.

[BibT_eX]

[DOI]

William Sims

Discret. Appl. Math., December, 2023

2022

Parallel Exploration of Directed Acyclic Graphs using the Actor Model.

[BibT_eX]

[DOI]

Rahul Prabhu

Amit Verma

CoRR, 2022

2021

A Slice-Traversal Algorithm for Very Large Mapped Volumetric Models.

[BibT_eX]

[DOI]

Jeremy Youngquist

Comput. Aided Des., 2021

2020

Rapid prediction of crucial hotspot interactions for icosahedral viral capsid self-assembly by energy landscape atlasing validated by mutagenesis.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2020

Atlasing of Assembly Landscapes using Distance Geometry and Graph Rigidity.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., 2020

Plane-Activated Mapped Microstructure.

[BibT_eX]

[DOI]

Jeremy Youngquist

CoRR, 2020

2019

Corner-sharing tetrahedra for modeling micro-structure.

[BibT_eX]

[DOI]

Comput. Aided Des., 2019

2018

Algorithm 990: Efficient Atlasing and Search of Configuration Spaces of Point-Sets Constrained by Distance Intervals.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2018

Combinatorial rigidity of incidence systems and application to dictionary learning.

[BibT_eX]

[DOI]

Mohamad Tarifi

J. Symb. Comput., 2018

Foreword to special issue.

[BibT_eX]

[DOI]

Audrey St. John

J. Symb. Comput., 2018

AlgorithmXXX: Efficient Atlasing and Search of Configuration Spaces of Point-Sets Constrained by Distance Intervals.

[BibT_eX]

[DOI]

CoRR, 2018

2016

Symmetry in Sphere-Based Assembly Configuration Spaces.

[BibT_eX]

[DOI]

Symmetry, 2016

2015

Algorithm 951: Cayley Analysis of Mechanism Configuration Spaces using CayMos: Software Functionalities and Architecture.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2015

Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2015

2014

Modeling Autonomous Supramolecular Assembly.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Topological Models in Molecular Biology, 2014

Cayley Analysis of Mechanism Configuration Spaces using CayMos: Software Functionalities and Architecture.

[BibT_eX]

[DOI]

CoRR, 2014

How the Beast really moves: Cayley analysis of mechanism realization spaces using CayMos.

[BibT_eX]

[DOI]

Comput. Aided Des., 2014

An Incidence Geometry Approach to Dictionary Learning.

[BibT_eX]

[DOI]

Mohamad Tarifi

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Geometry - 10th International Workshop, 2014

On Flattenability of Graphs.

[BibT_eX]

[DOI]

Joel Willoughby

Proceedings of the Automated Deduction in Geometry - 10th International Workshop, 2014

2012

Body-and-cad geometric constraint systems.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Robustness measure for an adeno-associated viral shell self-assembly is accurately predicted by configuration space atlasing using EASAL.

[BibT_eX]

[DOI]

Ruijin Wu

Aysegul Ozkan

Antonette Bennett

Mavis Agbandje-McKenna

Proceedings of the ACM International Conference on Bioinformatics, 2012

2011

Cayley Configuration Spaces of 1-dof Tree-decomposable Linkages, Part II: Combinatorial Characterization of Complexity

[BibT_eX]

[DOI]

CoRR, 2011

Cayley Configuration Spaces of 1-dof Tree-decomposable Linkages, Part I: Structure and Extreme Points

[BibT_eX]

[DOI]

CoRR, 2011

EASAL (Efficient Atlasing, Analysis and Search of Molecular Assembly Landscapes).

[BibT_eX]

Aysegul Ozkan

Proceedings of the ISCA 3rd International Conference on Bioinformatics and Computational Biology, 2011

Learning Hierarchical Sparse Representations using Iterative Dictionary Learning and Dimension Reduction.

[BibT_eX]

[DOI]

Mohamad Tarifi

Jeffery Ho

Proceedings of the Biologically Inspired Cognitive Architectures 2011, 2011

2010

Optimized parametrization of systems of incidences between rigid bodies.

[BibT_eX]

[DOI]

Yong Zhou

J. Symb. Comput., 2010

Reconciling Conflicting Combinatorial Preprocessors for Geometric Constraint Systems.

[BibT_eX]

[DOI]

Yong Zhou

Int. J. Comput. Geom. Appl., 2010

Characterizing Graphs with Convex and Connected Cayley Configuration Spaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Maxwell-independence: a better rank estimate for 3D rigidity matroids

[BibT_eX]

[DOI]

Jialong Cheng

CoRR, 2010

2009

Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces.

[BibT_eX]

[DOI]

Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Nucleation-free 3D rigidity.

[BibT_eX]

[DOI]

Jialong Cheng

Ileana Streinu

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

2008

Characterizing graphs with convex and connected configuration spaces

[BibT_eX]

[DOI]

CoRR, 2008

2007

Stability, Optimality and Complexity of Network Games with Pricing and Player Dropouts.

[BibT_eX]

[DOI]

Scalable Comput. Pract. Exp., 2007

Mutually unbiased bases and orthogonal decompositions of Lie algebras.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2007

2006

Solution space navigation for geometric constraint systems.

[BibT_eX]

[DOI]

Naganandhini Kohareswaran

Adam Arbree

Yong Zhou

ACM Trans. Graph., 2006

Modeling Virus Self-Assembly Pathways: Avoiding Dynamics Using Geometric Constraint Decomposition.

[BibT_eX]

[DOI]

Mavis Agbandje-McKenna

J. Comput. Biol., 2006

Well-formed Systems of Point Incidences for Resolving Collections of Rigid Bodies.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2006

Geometric constraints within feature hierarchies.

[BibT_eX]

[DOI]

Comput. Aided Des., 2006

Elimination in generically rigid 3D geometric constraint systems.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Geometry and Geometric Modeling, 2006

2005

Counting and Enumeration of Self-assembly pathways for Symmetric macromolecular Structures.

[BibT_eX]

[DOI]

Miklós Bóna

Proceedings of the Advances in Bioinformatics and Its Applications, 2005

2004

Network QoS games: stability vs optimality tradeoff.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Making constraint solvers more usable: overconstraint problem.

[BibT_eX]

[DOI]

Bo Yuan

Comput. Aided Des., 2004

2003

Stability vs. Optimality Tradeoff in Game Theoretic Mechanisms for QoS Provision.

[BibT_eX]

[DOI]

Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

Combinatorial Approaches to Geometric Constraint Solving: Problems, Progress, and Directions.

[BibT_eX]

[DOI]

Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2002

When Theory Meets Practice: Enriching the CS Curriculum through Industrial Case Studies.

[BibT_eX]

[DOI]

Joan Krone

David W. Juedes

Proceedings of the 15th Conference on Software Engineering Education and Training (CSEET'02), 2002

2001

Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms.

[BibT_eX]

[DOI]

J. Symb. Comput., 2001

Decomposition Plans for Geometric Constraint Systems, Part I: Performance Measures for CAD.

[BibT_eX]

[DOI]

J. Symb. Comput., 2001

Derandomized Learning of Boolean Functions over Finite Abelian Groups.

[BibT_eX]

[DOI]

Timothy Straney

Int. J. Found. Comput. Sci., 2001

FRONTIER: fully enabling geometric constraints for feature-based modeling and assembly.

[BibT_eX]

[DOI]

Proceedings of the Sixth ACM Symposium on Solid Modeling and Applications, 2001

2000

Generating hard tautologies using predicate logic and the symmetric group.

[BibT_eX]

[DOI]

Søren Riis

Log. J. IGPL, 2000

Quality of service provision in noncooperative networks with diverse user requirements.

[BibT_eX]

[DOI]

Shaogang Chen

Decis. Support Syst., 2000

Sampling Boolean Functions over Abelian Groups and Applications.

[BibT_eX]

[DOI]

Timothy Straney

Appl. Algebra Eng. Commun. Comput., 2000

1999

Planning Geometric Constraint Decomposition via Optimal Graph Transformations.

[BibT_eX]

[DOI]

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 1999

1998

Quality of service provision in noncooperative networks: heterogenous preferences, multi-dimensional QoS vectors, and burstiness.

[BibT_eX]

[DOI]

Shaogang Chen

Proceedings of the First International Conference on Information and Computation Economies, 1998

1997

Non-constant Degree Lower Bounds imply linear Degree Lower Bounds

[BibT_eX]

[DOI]

Søren Riis

Electron. Colloquium Comput. Complex., 1997

Finding Solvable Subsets of Constraint Graphs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

Deranomized Learning of Boolean Functions.

[BibT_eX]

[DOI]

Timothy Straney

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996

Stable basis families and complexity lower bounds

[BibT_eX]

[DOI]

Per Enflo

Electron. Colloquium Comput. Complex., 1996

Approximation from linear spaces and applications to complexity

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1996

1995

Pseudorandom Generators and Learning Algorithms for AC^0.

[BibT_eX]

[DOI]

Comput. Complex., 1995

Evaluating Spectral Norms for Constant Depth Circuits with Symmetric Gates.

[BibT_eX]

[DOI]

Comput. Complex., 1995

1994

Pseudorandom generators and learning algorithms for AC.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1990

Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra.

[BibT_eX]

[DOI]

Deborah Joseph