Theoretical Computer Science
Meta user
Network profile
1,464
reputation
11
14

Janne H. Korhonen

Postdoctoral researcher at Aalto University

12
answers
1
question
~10k
people reached
  • Helsinki, Finland
  • users.aalto.fi/~korhonj2
  • Member for 9 years, 5 months
  • 146 profile views
  • Last seen Aug 29 '17 at 9:28

Communities (2)

Top network posts

We respect a laser-like focus on one topic.

Top tags (25)

Score 56
Posts 7
Posts % 54
Score 55
Posts 4
Score 55
Posts 2
Score 39
Posts 1
Score 37
Posts 5
Score 19
Posts 2
View all tags →

Top posts (13) All Questions Answers | Votes Newest

39 Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?) Oct 5 '10
23 Time complexity analysis for Reingold's UST-CONN algorithm Sep 8 '10
16 Algorithmic lens in the social sciences May 4 '11
16 Smallest set not included in a collection of sets Dec 20 '12
13 SERF-reducibility and subexponential algorithms Dec 1 '11
13 Is there any other algorithm whose worst-case running time is exponential meanwhile it works very well in practice other than Simplex Algorithm? Nov 18 '10
9 What is the fastest way to check for set inclusion? Jan 29 '12
7 Treewidth and Packing Feb 19 '12
5 Pattern matching with don't cares: multiple patterns Nov 4 '16
4 Algebraic formulation for packing problem Feb 7 '12
View all questions and answers →

Badges (25)

Gold

—

Silver

11

Rarest

Bronze

14

Rarest

View all badges →