13306 search results - page 381 / 2662 » Theoretical Computer Science |
168
click to vote
ERSHOV
2003
Springer
16 years 1 days ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
178
click to vote
ICALP
2003
Springer
16 years 20 hour ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
189
click to vote
POPL
1990
ACM
15 years 11 months ago
1990
ACM
ical Abstract Machine Introduced in and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96(1):217
195
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
194
click to vote
FOCS
2003
IEEE
16 years 3 days ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...