Sciweavers

19798 search results - page 3788 / 3960
» Is Structural Subtyping Useful
Sort
View
235
Voted
POPL
2003
ACM
16 years 4 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
151
Voted
RECOMB
2006
Springer
16 years 4 months ago
Simulating Protein Motions with Rigidity Analysis
Abstract. Protein motions, ranging from molecular flexibility to largescale conformational change, play an essential role in many biochemical processes. Despite the explosion in ou...
Shawna L. Thomas, Xinyu Tang, Lydia Tapia, Nancy M...
185
Voted
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 4 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
124
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 4 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
ICALP
2009
Springer
16 years 4 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
« Prev « First page 3788 / 3960 Last » Next »