13306 search results - page 356 / 2662 » Theoretical Computer Science |
218
click to vote
TCS
2010
15 years 5 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
193
click to vote
TCS
2011
15 years 1 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
161
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
172
Voted
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
166
click to vote
SCCC
1999
IEEE
15 years 11 months ago
1999
IEEE
The recent studies in the distributed simulation area are focused in the High Level Architecture, defined by the DoD/USA, which proposes a standard environment to develop and run ...