Computer Science
András Salamon's user avatar
András Salamon's user avatar
András Salamon's user avatar
András Salamon
  • Member for 10 years, 11 months
  • Last seen more than 2 years ago
Profile Activity
Stats
3,452
reputation
123k
reached
35
answers
10
questions
Communities
View all
About

Computer scientist, working on theoretical questions that are motivated by practical problems. My thesis was on tractable classes of constraint satisfaction problems, and I have also worked on containment of conjunctive database queries, the macroscope model of communication complexity, lower bounds for streaming, and bounds on parallelism.

Badges
View all badges
1
gold badge
19
silver badges
35
bronze badges
Top tags
View all tags
124
Score
14
Posts
31
Posts %
68
Score
15
Posts
33
Posts %
28
Score
7
Posts
16
Posts %
18
Score
4
Posts
9
Posts %
17
Score
3
Posts
7
Posts %
16
Score
6
Posts
13
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
60
Factorial algorithm more efficient than naive multiplication
Sep 20, 2013
question
34
Is there an anti-Bloom filter?
Apr 25, 2014
answer
20
Converting (math) problems to SAT instances
May 18, 2013
answer
16
Can someone give a simple but non-toy example of a context-sensitive grammar?
Jan 2, 2013
answer
12
Are there any problems in $P$ which we do not know any $P$ algorithms?
May 20, 2018
answer
11
How to practically construct regular expander graphs?
Apr 24, 2013
answer
11
Are all databases reducible to this ultimate abstract database design?
May 16, 2013
answer
10
Is there a way to test if two NFAs accept the same language?
Jun 11, 2013
question
9
Myhill-Nerode style characterization of CFL?
Jun 12, 2013
answer
9
How to prove a problem is NOT NP-Complete?
Jun 21, 2013
Top Meta posts
0
3
7
Why the low voting rates?
7
The return of the homework question
6
Is there ever any point in adding "EDIT:" to a question or answer?
Top network posts
View all network posts
204
What packages do people load by default in LaTeX?
149
Major unsolved problems in theoretical computer science?
92
Animation in PDF presentations, without Adobe Reader?
55
Can one amplify P=NP beyond P=PH?
54
Constraint satisfaction problem (CSP) vs. satisfiability modulo theory (SMT); with a coda on constraint programming

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.