The following pages link to Orna Kupferman (Q216121):
Displaying 50 items.
- (Q4411830) (← links)
- (Q4417913) (← links)
- (Q4417914) (← links)
- (Q4428305) (← links)
- (Q4440425) (← links)
- (Q4449213) (← links)
- (Q4472441) (← links)
- (Q4494388) (← links)
- (Q4518425) (← links)
- (Q4536385) (← links)
- (Q4536596) (← links)
- (Q4542592) (← links)
- (Q4551135) (← links)
- On the Complexity of Universality for Partially Ordered NFAs (Q4608625) (← links)
- (Q4608660) (← links)
- (Q4633896) (← links)
- Approximating Deterministic Lattice Automata (Q4649285) (← links)
- Model Checking Systems and Specifications with Parameterized Atomic Propositions (Q4649292) (← links)
- (Q4708594) (← links)
- (Q4737196) (← links)
- (Q4791853) (← links)
- (Q4804910) (← links)
- (Q4809076) (← links)
- (Q4817542) (← links)
- Buy one, get one free!!! (Q4895547) (← links)
- Parameterized Weighted Containment (Q4910431) (← links)
- Unifying B\"uchi Complementation Constructions (Q4913776) (← links)
- Branching-Depth Hierarchies (Q4917027) (← links)
- Verification of Open Systems (Q4928701) (← links)
- Promptness in ω-Regular Automata (Q4931280) (← links)
- (Q4936149) (← links)
- (Q4952307) (← links)
- (Q4972740) (← links)
- (Q4992510) (← links)
- (Q5002847) (← links)
- Timed network games with clocks (Q5005123) (← links)
- Spanning-Tree Games. (Q5005136) (← links)
- (Q5021013) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- (Q5089219) (← links)
- On Repetition Languages (Q5089230) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5101349) (← links)
- (Q5111251) (← links)
- (Q5111621) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- (Q5136330) (← links)
- Weighted Safety (Q5166685) (← links)
- A Framework for Ranking Vacuity Results (Q5166686) (← links)
- An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications (Q5166702) (← links)
