Personensuche
X
?
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing ,
1
Faster k-SAT algorithms using biased-PPSZ:
, In:
?
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms ,
5
Faster algorithms for computing maximal 2-connected subgrap..:
, In:
?
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing ,
7
Simulating branching programs with edit distance and friend..:
, In:
?
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms ,
8
Subtree isomorphism revisited:
, In:
?
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing ,
9
An Improved Version of the Random-Facet Pivoting Rule for t..:
, In:
?
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms ,
10
Improved upper bounds for random-edge and random-jump on ab..:
, In:
?
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms ,
11
Dantzig's pivoting rule for shortest paths, deterministic M..:
, In:
?
Proceedings of the forty-third annual ACM symposium on Theory of computing ,
14
Subexponential lower bounds for randomized pivoting rules f..:
, In:
?
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms ,
15