9842 search results - page 414 / 1969 » The Complexity of the Matching-Cut Problem |
202
Voted
ASE
1998
15 years 7 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...
272
Voted
PODC
2011
ACM
14 years 10 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...
224
Voted
EUROCRYPT
2012
Springer
13 years 10 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...
224
click to vote
COMPGEOM
2010
ACM
16 years 23 days 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 ...
213
click to vote
ISW
2010
Springer
15 years 5 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...