1653 search results - page 253 / 331 » Computer science and game theory |
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
93
Voted
FOCS
1999
IEEE
15 years 3 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
153
click to vote
FOCS
1997
IEEE
15 years 3 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
85
Voted
SOFSEM
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. Formal methods based on the mathematical theory of partially ordered sets (i.e., posets) have been used in the database field for the modelling of spatial data since many...
STACS
1994
Springer
15 years 3 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...