The following pages link to Eitan M. Gurari (Q1136222):
Displayed 19 items.
- Simple counter machines and number-theoretic problems (Q1136223) (← links)
- The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- Some simplified undecidable and NP-hard problems for simple programs (Q1157168) (← links)
- On the space complexity of recursive algorithms (Q1253916) (← links)
- Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem (Q3219762) (← links)
- Two-way counter machines and finite-state transducers† (Q3680282) (← links)
- Decidable problems for powerful programs (Q3766814) (← links)
- (Q3780411) (← links)
- Path Systems: Constructions, Solutions and Applications (Q3893308) (← links)
- The Complexity of the Equivalence Problem for Simple Programs (Q3912019) (← links)
- (Q3940845) (← links)
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable (Q3947121) (← links)
- (Semi)alternating stack automata (Q3959454) (← links)
- Two-Way Counter Machines and Diophantine Equations (Q3960829) (← links)
- A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)
- An NP-Complete Number-Theoretic Problem (Q4194462) (← links)
- An NP-complete number-theoretic problem (Q5402559) (← links)