Network profile

Marc Bury

Reputation

1,338

1.3k
1.3k
1.3k

2018
2019
2020
2021

Top tag

cc.complexity-theory

Next privilege

2,000 Rep.

Edit questions and answers

Badges

9

17

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

1 helpful flag

49 votes cast

7 Questions

Votes Activity Newest Views

3

15

votes

1

answer

760

views

Most significant bit of integer multiplication and binary decision diagrams

cc.complexity-theory binary-decision-diagrams

Oct 28 '11 at 9:31 meolic 223

3

10

votes

2

answers

600

views

What happens if we improve the time hierarchy theorems?

cc.complexity-theory lower-bounds big-picture time-complexity time-hierarchy

Jan 9 '12 at 23:43 Community♦ 1

1

10

votes

0

answers

280

views

Lower bound method for ordered binary decision diagrams

cc.complexity-theory lower-bounds boolean-functions binary-decision-diagrams

Mar 5 '11 at 6:34 Community♦ 1

1

10

votes

1

answer

334

views

Lower bound on the number of “short” paths in a rooted tree with polynomial size

graph-theory tree

Dec 14 '10 at 23:03 Peter Shor 23.1k

7

votes

0

answers

190

views

Communication complexity of random functions with limited independence

cc.complexity-theory randomness communication-complexity

Oct 8 '12 at 4:53 Community♦ 1

7

votes

1

answer

306

views

Parallel algorithms to color interval graphs

ds.algorithms graph-algorithms dc.parallel-comp graph-colouring

Jun 17 '11 at 2:37 Hsien-Chih Chang 張顯之 7,477

4

votes

0

answers

177

views

Randomized Parallel Algorithm for Maximal Independent Set

reference-request randomized-algorithms dc.parallel-comp derandomization

Jan 10 '14 at 15:52 Marc Bury 1,338

Theoretical Computer Science Stack Exchange works best with JavaScript enabled