SODA
2012
ACM
12 years 2 months ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
SODA
2012
ACM
12 years 2 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
SODA
2012
ACM
12 years 2 months ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
TON
2012
12 years 2 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
CRYPTO
2012
Springer
12 years 2 months ago
2012
Springer
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
INFOCOM
2012
IEEE
12 years 2 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
PODS
2012
ACM
12 years 2 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
TACAS
2012
Springer
12 years 7 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
STACS
2012
Springer
12 years 7 months ago
2012
Springer
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
ESOP
2012
Springer
12 years 7 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...