Yuval Filmus

Haifa, Israel

https://yuvalfilmus.cs.technion.ac.il/

Associate Professor at the Henry and Marilyn Taub Department of Computer Science at the Technion – Israel Institute of Technology.

top accounts reputation activity subscriptions

What's the best way to write e-mail addresses?

symbols addresses asked Jul 27, 2010 at 4:02

tex.stackexchange.com

144 votes

Identification of a curious function

calculus sequences-and-series functions special-functions game-theory asked Aug 18, 2013 at 7:44

math.stackexchange.com

60 votes

Good examples of double induction

induction examples-counterexamples big-list asked Jan 21, 2011 at 18:42

math.stackexchange.com

29 votes

Asymptotics of the number of words in a regular language of given length

formal-languages reference-request regular-languages asymptotics combinatorics asked Apr 16, 2013 at 1:37

cs.stackexchange.com

27 votes

Theorems true "with probability 1"?

big-list fake-proofs asked Jun 16, 2011 at 2:24

math.stackexchange.com

27 votes

Coloring complexity of graphs

reference-request graph-theory co.combinatorics graph-colouring decision-trees asked Jul 20, 2012 at 20:19

cstheory.stackexchange.com

24 votes

Balls and Bins analysis in the $m \gg n$ regime: gaps

reference-request pr.probability asked Nov 29, 2012 at 12:44

cstheory.stackexchange.com

19 votes

Exponential separation between NFAs and DFAs in the presence of unions

regular-languages finite-automata asked Jul 27, 2013 at 11:42

cs.stackexchange.com

17 votes

Beamer: how to make each frame appear in the PDF toc?

beamer pdf asked May 3, 2011 at 0:16

tex.stackexchange.com

17 votes

Disabling bumping for retags by hi-rep users

feature-request status-declined tags bump asked Jun 3, 2011 at 23:05

meta.stackexchange.com

Top Answers

287

How to study math to really understand it and have a healthy lifestyle with free time?

math.stackexchange.com

252

Why is writing down mathematical proofs more fault-proof than writing computer code?

cs.stackexchange.com

Keeping a String Secret in (Open) Source Code

cs.stackexchange.com

Does $\mathsf{P} \ne \mathsf{NP}$ imply that $|\mathsf{NP}| > |\mathsf{P}|$?

cs.stackexchange.com

Can a computer determine whether a mathematical statement is true or not?

cs.stackexchange.com

Sum of First $n$ Squares Equals $\frac{n(n+1)(2n+1)}{6}$

math.stackexchange.com

Choose a random number between $0$ and $1$ and record its value. Keep doing it until the sum of the numbers exceeds $1$. How many tries do we need?

math.stackexchange.com

Why, although these functions have the same derivative, do they not differ by a constant?

math.stackexchange.com

Boolean search explained

cs.stackexchange.com

Pseudonyms of famous mathematicians

mathoverflow.net

Why is the Turing Machine a popular model of computation?

cs.stackexchange.com

Why are ambiguous grammars bad?

cs.stackexchange.com

Minimum spanning tree vs Shortest path

cs.stackexchange.com

What exactly is polynomial time?

cs.stackexchange.com

Order of elements is lcm-closed in abelian groups

math.stackexchange.com

Example of an algorithm that lacks a proof of correctness

cs.stackexchange.com

Time complexity of an algorithm: Is it important to state the base of the logarithm?

cs.stackexchange.com

Why is $A \lor (A \land \neg B) \equiv A$?

cs.stackexchange.com

Why is SAT so important in theoretical computer science?

cs.stackexchange.com

Comparing $\pi^e$ and $e^\pi$ without calculating them

math.stackexchange.com

$x^y = y^x$ for integers $x$ and $y$

math.stackexchange.com

Quantum Computing and Turing Machines: Are Turing Machines still an Accurate Measure?

cs.stackexchange.com

Prime number between $n$ and $n!+1$

math.stackexchange.com

How does a computer determine the data type of a byte?

cs.stackexchange.com

Would the P vs. NP problem become trivial as a result of the development of universal quantum computers?

cs.stackexchange.com

Can Quantum Computing solve Problems not even a Turing Machine can solve?

cs.stackexchange.com

Simple (non-mathematical) definition of polynomial time?

cs.stackexchange.com

What is the definition of Computer Science, and what is the Science within Computer Science?

cs.stackexchange.com

Are there any functions with Big O (Busy Beaver(n))?

cs.stackexchange.com

Could Gödel’s incompleteness theorem be circumvented with a quine?

cs.stackexchange.com