The following pages link to Gennaro Parlato (Q515664):
Displayed 24 items.
- On the path-width of integer linear programming (Q515665) (← links)
- Verification of scope-dependent hierarchical state machines (Q948087) (← links)
- Fast payment schemes for truthful mechanisms with verification (Q1006066) (← links)
- (Q1041718) (redirect page) (← links)
- A linear time algorithm for the minimum weighted feedback vertex set on diamonds (Q1041719) (← links)
- Reachability of scope-bounded multistack pushdown systems (Q2216111) (← links)
- A Unifying Approach for Multistack Pushdown Automata (Q2922031) (← links)
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width (Q2957490) (← links)
- A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem (Q3091541) (← links)
- Minimum Weighted Feedback Vertex Set on Diamonds (Q3439134) (← links)
- An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
- The Language Theory of Bounded Context-Switching (Q3557012) (← links)
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability (Q3636878) (← links)
- (Q4449219) (← links)
- (Q4995360) (← links)
- Context-Bounded Analysis of TSO Systems (Q5170741) (← links)
- Policy Analysis for Self-administrated Role-Based Access Control (Q5326342) (← links)
- The tree width of auxiliary storage (Q5408550) (← links)
- Decidable logics combining heap structures and data (Q5408581) (← links)
- On the Complexity of Ltl Model-Checking of Recursive State Machines (Q5428871) (← links)
- Context-Bounded Analysis of Concurrent Queue Systems (Q5458334) (← links)
- Scope-Bounded Pushdown Languages (Q5890814) (← links)
- Scope-Bounded Pushdown Languages (Q5891814) (← links)
- Approximation and Online Algorithms (Q5898470) (← links)