User Marcus Ritt

122 votes

13 answers

12k views

Advice on good research practices

Kaveh

21.3k

asked Nov 13, 2010 at 10:03

103 votes

39 answers

14k views

What are the recent TCS books whose drafts are available online?

reference-request big-list books

Rahab

301

asked Dec 5, 2010 at 2:01

66 votes

3 answers

8k views

How do I referee a paper?

soft-question big-list paper-review

RJK

1,952

asked Oct 3, 2010 at 14:44

56 votes

10 answers

4k views

Provable statements about genetic algorithms

ds.algorithms ne.neural-evol

Suresh Venkat

31.7k

asked Sep 1, 2010 at 19:01

46 votes

5 answers

3k views

Positive topological ordering

ds.algorithms directed-acyclic-graph partial-order topological-sorting

David Eppstein

50.2k

asked Sep 16, 2010 at 1:24

41 votes

9 answers

5k views

References for TCS proof techniques

reference-request proof-techniques

Kurt

829

asked Aug 18, 2010 at 4:27

33 votes

9 answers

2k views

Randomized algorithm that "looks" deterministic?

ds.algorithms randomized-algorithms

arnab

6,940

asked Nov 1, 2010 at 9:11

32 votes

3 answers

2k views

Are any of the state of the art Maximum Flow algorithms practical?

ds.algorithms graph-algorithms application-of-theory max-flow

Rob Lachlan

421

asked Feb 3, 2013 at 20:27

30 votes

5 answers

3k views

Binary search generalizations for posets?

ds.algorithms ds.data-structures partial-order order-theory search-problem

jkff

8,651

asked Nov 11, 2011 at 4:39

27 votes

3 answers

1k views

Succinct Problems in $\mathsf{P}$

cc.complexity-theory reference-request complexity-classes

Nikhil

1,334

asked Feb 21, 2012 at 17:50

27 votes

6 answers

2k views

How do you get a "Physical Intuition" for results in TCS?

soft-question intuition

gabgoh

1,528

asked Feb 8, 2011 at 20:38

27 votes

1 answer

888 views

Other applications of Karger-Stein branching amplification?

ds.algorithms reference-request randomized-algorithms teaching

Jeffε

22.8k

asked Oct 23, 2010 at 20:37

22 votes

2 answers

1k views

Polynomial time approximation algorithms for machine scheduling: how many open problems are left?

ds.algorithms approximation-algorithms open-problem approximation-hardness scheduling

Oleksandr Bondarenko

4,195

asked Sep 13, 2010 at 17:50

21 votes

1 answer

3k views

How to write the introduction of a research paper?

soft-question advice-request research-practice writing

Madhav Jha

373

asked Apr 13, 2014 at 22:50

16 votes

1 answer

499 views

Complexity of deciding whether a family is a Sperner familiy

ds.algorithms co.combinatorics

Anthony Leverrier

987

asked Nov 19, 2010 at 13:22

14 votes

1 answer

684 views

Complexity class associated with exhaustive search

cc.complexity-theory ds.algorithms reference-request big-picture machine-models

Anonymous

3,993

asked Nov 20, 2012 at 18:32

14 votes

4 answers

2k views

Theoretical study of coordinate descent methods

ds.algorithms reference-request optimization heuristics

Suresh Venkat

31.7k

asked Aug 12, 2011 at 19:00

13 votes

1 answer

2k views

What is the tradeoff between population size and the number of generations in genetic algorithms

ds.algorithms machine-learning genetic-algorithms

Matt Munson

483

asked Feb 26, 2011 at 6:23

13 votes

0 answers

342 views

Applications of an access lemma for dynamic forests?

ds.data-structures tree dynamic-algorithms amortized-analysis

Jeffε

22.8k

asked Mar 16, 2011 at 6:02

12 votes

1 answer

3k views

Complexity of converting a boolean circuit to a boolean formula

cc.complexity-theory time-complexity boolean-functions

Nikhil

1,334

asked Feb 11, 2011 at 19:11

9 votes

0 answers

311 views

Beating Nonuniformity by Oracle Access

cc.complexity-theory pr.probability advice-and-nonuniformity

M.S. Dousti

16.3k

asked Feb 8, 2011 at 10:55

6 votes

2 answers

376 views

What limits the performance of evolutionary computing techniques?

ne.neural-evol genetic-algorithms genetic-programming

yaron shavit

61

asked Oct 17, 2011 at 18:22

1 vote

0 answers

35 views

Scheduling with Separation Constraint

np-hardness scheduling

Soumya Basu

171

asked May 9, 2019 at 16:40

Stack Exchange Network

current community

your communities

more stack exchange communities

23 Bookmarks

Advice on good research practices

What are the recent TCS books whose drafts are available online?

How do I referee a paper?

Provable statements about genetic algorithms

Positive topological ordering

References for TCS proof techniques

Randomized algorithm that "looks" deterministic?

Are any of the state of the art Maximum Flow algorithms practical?

Binary search generalizations for posets?

Succinct Problems in $\mathsf{P}$

How do you get a "Physical Intuition" for results in TCS?

Other applications of Karger-Stein branching amplification?

Polynomial time approximation algorithms for machine scheduling: how many open problems are left?

How to write the introduction of a research paper?

Complexity of deciding whether a family is a Sperner familiy

Complexity class associated with exhaustive search

Theoretical study of coordinate descent methods

What is the tradeoff between population size and the number of generations in genetic algorithms

Applications of an access lemma for dynamic forests?

Complexity of converting a boolean circuit to a boolean formula

Beating Nonuniformity by Oracle Access

What limits the performance of evolutionary computing techniques?

Scheduling with Separation Constraint