4378 search results - page 297 / 876 » On the Complexity of Ordered Colourings |
183
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
200
Voted
HPCA
2009
IEEE
16 years 7 months ago
2009
IEEE
The number of functional errors escaping design verification and being released into final silicon is growing, due to the increasing complexity and shrinking production schedules ...
288
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
155
click to vote
NDSS
2008
IEEE
16 years 1 months ago
2008
IEEE
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
179
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...