9842 search results - page 414 / 1969 » The Complexity of the Matching-Cut Problem |
141
click to vote
ASE
1998
15 years 4 months ago
1998
Designing a complex software system is a cognitivelychallengingtask; thus, designers need cognitive support to create good designs. Domain-oriented design environments are cooperat...
192
Voted
PODC
2011
ACM
14 years 7 months ago
2011
ACM
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
158
click to vote
EUROCRYPT
2012
Springer
13 years 7 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
152
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
160
click to vote
ISW
2010
Springer
15 years 2 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...