The following pages link to Angelo Monti (Q211677):
Displaying 50 items.
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
- (Q719270) (redirect page) (← links)
- Rainbow graph splitting (Q719272) (← links)
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- Broadcasting in dynamic radio networks (Q1015809) (← links)
- Testing and reconfiguration of VLSI linear arrays (Q1128669) (← links)
- A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933) (← links)
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations (Q1323359) (← links)
- A Kleene-like characterization of languages accepted by systolic tree automata (Q1333404) (← links)
- On the computational complexity of graph closures (Q1351617) (← links)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Systolic tree \(\omega\)-languages: The operational and the logical view (Q1575949) (← links)
- On variants of vertex geography on undirected graphs (Q1627869) (← links)
- Graphs that are not pairwise compatible: a new proof technique (extended abstract) (Q1670981) (← links)
- On dynamic threshold graphs and related classes (Q1705777) (← links)
- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506) (← links)
- Round robin is optimal for fault-tolerant broadcasting on wireless networks (Q1878699) (← links)
- String factorisations with maximum or minimum dimension (Q2006777) (← links)
- Some classes of graphs that are not PCGs (Q2272401) (← links)
- Co-divergence and tree topology (Q2315220) (← links)
- Fast flooding over Manhattan (Q2375821) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- Compact representations of the intersection structure of families of finite sets (Q2706199) (← links)
- String quartets in binary (Q2709843) (← links)
- Self-similarity bounds for locally thin set families (Q2757074) (← links)
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract) (Q2768369) (← links)
- Logical definability of \(Y\)-tree and trellis systolic \(\omega\)-languages (Q2770585) (← links)
- Distributed multi-broadcast in unknown radio networks (Q2787689) (← links)
- Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs (Q2803835) (← links)
- Reverse-free codes and permutations (Q2857375) (← links)
- Optimal gossiping in geometric radio networks in the presence of dynamical faults (Q2894246) (← links)
- Flooding time in edge-Markovian dynamic graphs (Q2934348) (← links)
- On Reverse-Free Codes and Permutations (Q3008020) (← links)
- Flooding Time of Edge-Markovian Evolving Graphs (Q3013157) (← links)
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem (Q3508564) (← links)
- Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults (Q3525590) (← links)
- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks (Q3613654) (← links)
- SYSTOLIC TREE WITH BASE AUTOMATA (Q4007853) (← links)
- (Q4266540) (← links)
- (Q4341029) (← links)
- (Q4381397) (← links)
- (Q4427854) (← links)
- Families of locally separated Hamilton paths (Q4581272) (← links)
- Systolic tree ω-languages (Q4596616) (← links)
- (Q4785466) (← links)
- (Q4796195) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- On reconfigurability of VLSI linear arrays (Q5060146) (← links)
