Theoretical Computer Science
Meta user
Network profile
3,911
reputation
1
14
24

Shaull

Assistant Professor at the Technion, Israel.

Research interests: Dynamical Systems, Formal Verification, Temporal Logic, Automata Theory, Weighted Automata and Weighted Logics, and all things theoretical.

48
answers
16
questions
~47k
people reached
  • Israel
  • shaull.github.io
  • Member for 8 years, 1 month
  • 414 profile views
  • Last seen 4 hours ago

Communities (6)

Top network posts

Top tags (70)

Score 78
Posts 16
Posts % 25
Score 74
Posts 11
Score 64
Posts 10
Score 30
Posts 6
Score 29
Posts 5
Score 26
Posts 4
View all tags →

Top posts (64) All Questions Answers | Votes Newest

28 Hardest known natural problem in P? Jan 9 '14
17 A simple decision problem whose decidability is not known Sep 4 '13
16 How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language? Jan 12 '14
16 Teaching high school TCS - existing programs Nov 8 '13
12 Arithmetic circuits with $\min$, $\max$, and average over $[0,1]$ Feb 11 '13
12 When does randomization stops helping within PSPACE Apr 30 '15
12 Minimizing Automata accepting $\omega$-words (i.e. infinite words) Dec 26 '14
10 Is it possible to test if a computable number is rational or integer? Feb 17 '13
9 Lower bound on number of oracle calls for solving $n$ instances of the halting problem Mar 19 '13
9 Is SAT with two “opposite” solutions NP-hard? Jul 13 '15
View all questions and answers →

Badges (39)

Gold

1

Rarest

Silver

14

Rarest

Bronze

24

Rarest

View all badges →