The following pages link to Linda Pagli (Q287201):
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)
- (Q436828) (redirect page) (← links)
- Computing all the best swap edges distributively (Q436830) (← links)
- Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
- Getting close without touching: near-gathering for autonomous mobile robots (Q748118) (← links)
- Linear time distributed swap edge algorithms (Q783711) (← 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)
- 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)
- Testing and reconfiguration of VLSI linear arrays (Q1128669) (← links)
- A note on optimal allocation of files in a symmetric and homogeneous network (Q1139370) (← 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)
- A new model for large memories (Q1207786) (← links)
- Height-balanced multiway trees (Q1259897) (← links)
- Counting the number of fault patterns in redundant VLSI arrays (Q1330668) (← links)
- Diagonal channel routing with vias at unit distance (Q1346984) (← links)
- Computing with time-varying data: Sequential complexity and parallel speed-up (Q1384702) (← links)
- Text sparsification via local maxima. (Q1401406) (← 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)
- From the Earth to the Moon: two stories of women and mathematics (Q2230623) (← links)
- Compacting and grouping mobile agents on dynamic rings (Q2327463) (← links)
- Exploiting regularities for Boolean function synthesis (Q2432543) (← links)
- Approximate matching for two families of trees (Q2508340) (← links)
- Preface: Fun with algorithms (Q2565615) (← links)
- (Q2736343) (← links)
- (Q3044312) (← links)
- (Q3065865) (← links)
- (Q3139515) (← links)
- A model of sequential computation with Pipelined access to memory (Q3142000) (← links)
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY (Q3444837) (← links)
- On formal descriptions for knitting recursive patterns (Q3541196) (← links)
- (Q3675556) (← links)
- (Q3735087) (← links)
- (Q3838394) (← links)
- (Q3854665) (← links)
- (Q3893361) (← links)
- On the Height of Height-Balanced Trees (Q4077443) (← links)
