The following pages link to Fabrizio Luccio (Q287200):
Displaying 50 items.
- An insight on PRAM computational bounds (Q287202) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Compact DSOP and partial DSOP forms (Q385501) (← links)
- Arithmetic for rooted trees (Q519885) (← links)
- (Q582092) (redirect page) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- Analysis of parallel uniform hashing (Q750157) (← links)
- \(k\)-restricted rotation distance between binary trees (Q845999) (← links)
- Dense trees: a new look at degenerate graphs (Q849635) (← links)
- Refined upper bounds for right-arm rotation distances (Q884484) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- String matching with weighted errors (Q909451) (← links)
- A new scheme for the deterministic simulation of PRAMs in VLSI (Q911777) (← links)
- Routing in times square mode (Q917294) (← links)
- Synthesis of autosymmetric functions in a new three-level form (Q927395) (← links)
- The Fermat star of binary trees (Q987825) (← links)
- A probabilistic simulation of PRAMs on a bounded degree network (Q1113672) (← links)
- String search in coarse-grained parallel computers (Q1125800) (← links)
- The problem of quasi sorting (Q1144933) (← links)
- A linear algorithm to determine minimal spanning forests in chain graphs (Q1166934) (← links)
- An efficient algorithm for some tree matching problems (Q1182118) (← links)
- Finding all the palindromes in a binary tree in linear time and space (Q1201867) (← links)
- Dynamic dictionary matching in external memory (Q1275745) (← links)
- Diagonal channel routing with vias at unit distance (Q1346984) (← links)
- Computing with time-varying data: Sequential complexity and parallel speed-up (Q1384702) (← links)
- Dynamic monopolies in tori. (Q1427199) (← links)
- Lower bounds on the rotation distance of binary trees (Q1675757) (← links)
- On the upper bound on the rotation distance of binary trees (Q1823251) (← links)
- A preliminary study of a diagonal channel-routing model (Q1825653) (← links)
- Chain rotations: a new look at tree distance (Q1943634) (← links)
- Exploiting regularities for Boolean function synthesis (Q2432543) (← links)
- Approximate matching for two families of trees (Q2508340) (← links)
- Some aspects of the recognition of convex polyhedra from two plane projections. I (Q2542691) (← links)
- A technique for graph embedding with constraints on node and arc correspondences (Q2555871) (← links)
- Some aspects of the recognition of convex polyhedra from two plane projections. II (Q2561973) (← links)
- (Q2736343) (← links)
- (Q3044312) (← links)
- (Q3065865) (← links)
- A model of sequential computation with Pipelined access to memory (Q3142000) (← links)
- (Q3314986) (← links)
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY (Q3444837) (← links)
- (Q3675556) (← links)
- (Q3838394) (← links)
- (Q3854665) (← links)
- (Q3893361) (← links)
- ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING (Q4020281) (← links)
- (Q4028886) (← links)
- On the Height of Height-Balanced Trees (Q4077443) (← links)
- Rebalancing Height Balanced Trees (Q4158473) (← links)
- Power trees (Q4167590) (← links)
