The following pages link to Domenico Parente (Q671528):
Displaying 19 items.
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- (Q948086) (redirect page) (← links)
- Verification of scope-dependent hierarchical state machines (Q948087) (← links)
- (Q1283931) (redirect page) (← links)
- A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933) (← links)
- Model-checking graded computation-tree logic with finite path semantics (Q2285155) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- A Compositional Approach to Synchronize Two Dimensional Networks of Processors (Q2729630) (← links)
- On a Logic for Coalitional Games with Priced-Resource Agents (Q2825419) (← links)
- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem (Q2944883) (← links)
- Model Checking for Graded CTL (Q3400570) (← links)
- Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS (Q3444850) (← links)
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- On the Membership Problem for Visibly Pushdown Languages (Q3522902) (← links)
- Enriched MU-Calculi Module Checking (Q3535606) (← links)
- CTL Model-Checking with Graded Quantifiers (Q3540061) (← links)
- (Q4449219) (← links)
- (Q4530005) (← links)
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY (Q4667918) (← links)
- (Q4794305) (← links)
- (Q4992519) (← links)
- Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- Synchronization of 1-way connected processors (Q5055943) (← links)
- Structural Information and Communication Complexity (Q5315222) (← links)
- Program Complexity in Hierarchical Module Checking (Q5505563) (← links)
- Developments in Language Theory (Q5711954) (← links)
- Graded Alternating-Time Temporal Logic (Q5894019) (← links)
- Graded Alternating-Time Temporal Logic (Q5894193) (← links)
- Theoretical Computer Science (Q5897356) (← links)
- (Q1207785) (redirect page) (← links)
- A new model for large memories (Q1207786) (← links)
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations (Q1323359) (← links)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
- (Q3832052) (← links)
- (Q3842794) (← links)
- SYSTOLIC TREE WITH BASE AUTOMATA (Q4007853) (← links)
- (Q4266540) (← links)
- (Q4348010) (← links)
- (Q4377122) (← links)
- A new approach to optimal planning of robot motion on a tree with obstacles (Q4595513) (← links)
- Placing resources in a tree: Dynamic and static algorithms (Q4645181) (← links)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338) (← links)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata (Q4835866) (← links)
- (Q4864792) (← links)
- (Q4890704) (← links)
- State complexity of SBTA languages (Q5096343) (← links)
