2009 |
29 | EE | Heping Gao,
Meera Sitharam:
Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces.
SAC 2009: 1122-1126 |
28 | EE | Kirk Haller,
Audrey Lee-St. John,
Meera Sitharam,
Ileana Streinu,
Neil White:
Body-and-cad geometric constraint systems.
SAC 2009: 1127-1131 |
2008 |
27 | EE | Meera Sitharam,
Heping Gao:
Characterizing graphs with convex and connected configuration spaces
CoRR abs/0809.3935: (2008) |
26 | EE | Heping Gao,
Meera Sitharam:
Characterizing 1-Dof Henneberg-I graphs with efficient configuration spaces
CoRR abs/0810.1997: (2008) |
2006 |
25 | EE | Meera Sitharam,
Adam Arbree,
Yong Zhou,
Naganandhini Kohareswaran:
Solution space navigation for geometric constraint systems.
ACM Trans. Graph. 25(2): 194-213 (2006) |
24 | EE | Meera Sitharam,
Jianjun Oung,
Yong Zhou,
Adam Arbree:
Geometric constraints within feature hierarchies.
Computer-Aided Design 38(1): 22-38 (2006) |
23 | EE | Meera Sitharam:
Well-formed Systems of Point Incidences for Resolving Collections of Rigid Bodies.
Int. J. Comput. Geometry Appl. 16(5-6): 591-615 (2006) |
22 | EE | Meera Sitharam,
Mavis Agbandje-Mckenna:
Modeling Virus Self-Assembly Pathways: Avoiding Dynamics Using Geometric Constraint Decomposition.
Journal of Computational Biology 13(6): 1232-1265 (2006) |
2004 |
21 | EE | Christoph M. Hoffmann,
Meera Sitharam,
Bo Yuan:
Making constraint solvers more usable: overconstraint problem.
Computer-Aided Design 36(4): 377-399 (2004) |
20 | EE | Andrew Lomonosov,
Meera Sitharam,
Kihong Park:
Network QoS games: stability vs optimality tradeoff.
J. Comput. Syst. Sci. 69(2): 281-302 (2004) |
2003 |
19 | | Andrew Lomonosov,
Meera Sitharam,
Kihong Park:
Stability vs. Optimality Tradeoff in Game Theoretic Mechanisms for QoS Provision.
SAC 2003: 28-32 |
2002 |
18 | EE | Joan Krone,
David W. Juedes,
Meera Sitharam:
When Theory Meets Practice: Enriching the CS Curriculum through Industrial Case Studies.
CSEE&T 2002: 207-214 |
2001 |
17 | EE | Jianjun Oung,
Meera Sitharam,
Brandon Moro,
Adam Arbree:
FRONTIER: fully enabling geometric constraints for feature-based modeling and assembly.
Symposium on Solid Modeling and Applications 2001: 307-308 |
16 | | Meera Sitharam,
Timothy Straney:
Derandomized Learning of Boolean Functions over Finite Abelian Groups.
Int. J. Found. Comput. Sci. 12(4): 491-516 (2001) |
15 | | Christoph M. Hoffmann,
Andrew Lomonosov,
Meera Sitharam:
Decomposition Plans for Geometric Constraint Systems, Part I: Performance Measures for CAD.
J. Symb. Comput. 31(4): 367-408 (2001) |
14 | | Christoph M. Hoffmann,
Andrew Lomonosov,
Meera Sitharam:
Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms.
J. Symb. Comput. 31(4): 409-427 (2001) |
2000 |
13 | EE | Meera Sitharam,
Timothy Straney:
Sampling Boolean Functions over Abelian Groups and Applications.
Appl. Algebra Eng. Commun. Comput. 11(2): 89-109 (2000) |
12 | EE | Søren Riis,
Meera Sitharam:
Generating hard tautologies using predicate logic and the symmetric group.
Logic Journal of the IGPL 8(6): (2000) |
1999 |
11 | EE | Christoph M. Hoffmann,
Andrew Lomonosov,
Meera Sitharam:
Planning Geometric Constraint Decomposition via Optimal Graph Transformations.
AGTIVE 1999: 309-324 |
1997 |
10 | | Meera Sitharam,
Timothy Straney:
Deranomized Learning of Boolean Functions.
ALT 1997: 100-115 |
9 | | Christoph M. Hoffmann,
Andrew Lomonosov,
Meera Sitharam:
Finding Solvable Subsets of Constraint Graphs.
CP 1997: 463-477 |
8 | EE | Søren Riis,
Meera Sitharam:
Non-constant Degree Lower Bounds imply linear Degree Lower Bounds
Electronic Colloquium on Computational Complexity (ECCC) 4(48): (1997) |
1996 |
7 | EE | Meera Sitharam:
Approximation from linear spaces and applications to complexity
Electronic Colloquium on Computational Complexity (ECCC) 3(30): (1996) |
6 | EE | Per Enflo,
Meera Sitharam:
Stable basis families and complexity lower bounds
Electronic Colloquium on Computational Complexity (ECCC) 3(49): (1996) |
1995 |
5 | | Meera Sitharam:
Evaluating Spectral Norms for Constant Depth Circuits with Symmetric Gates.
Computational Complexity 5(2): 167-189 (1995) |
4 | | Meera Sitharam:
Pseudorandom Generators and Learning Algorithms for AC^0.
Computational Complexity 5(3/4): 248-266 (1995) |
1994 |
3 | EE | Meera Sitharam:
Pseudorandom generators and learning algorithms for AC.
STOC 1994: 478-486 |
1990 |
2 | | Deborah Joseph,
Meera Sitharam:
Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra.
STACS 1990: 152-164 |
1989 |
1 | | Alberto Bertoni,
Danilo Bruschi,
Deborah Joseph,
Meera Sitharam,
Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
FCT 1989: 35-46 |