612 search results - page 67 / 123 » Hardness assumptions in the foundations of theoretical compu... |
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
CBSE
2011
Springer
12 years 7 months ago
2011
Springer
Orphan requests are a significant problem for multi-tier distributed systems since they adversely impact system correctness by violating the exactly-once semantics of application...
HPDC
2012
IEEE
11 years 10 months ago
2012
IEEE
Consider a multithreaded parallel application running inside a multicore virtual machine context that is itself hosted on a multi-socket multicore physical machine. How should the...
MINENET
2005
ACM
14 years 1 months ago
2005
ACM
BGP routing updates collected by monitoring projects such as RouteViews and RIPE have been a vital source to our understanding of the global routing system. The updates logged by ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...