Linda Pagli | Academic Influence

Linda Pagli's AcademicInfluence.com Rankings

Linda Pagli

Computer Science

#10437

World Rank

#10962

Historical Rank

Database

#9648

World Rank

#10192

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Linda Pagli's Degrees

Bachelors Computer Science University of Milan
Masters Computer Science University of Milan

Similar Degrees You Can Earn

Why Is Linda Pagli Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Linda Pagli is an Italian computer scientist specializing in computer networks and distributed algorithms. She is a professor at the University of Pisa, and a Fellow of the Italian Academy for Advanced Studies in America. She has also worked with UNESCO and the Italian Ministry of Foreign Affairs to help spread expertise in computer science to developing countries.

(See a Problem?)

Linda Pagli's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Dynamic monopolies in tori (2004) (85)
On a New Boolean Function with Applications (1999) (74)
Exact Rooted Subtree Matching in Sublinear Time (2001) (47)
Irreversible Dynamos in Butterflies (1999) (41)
Network decontamination in Presence of Local Immunity (2007) (39)
On the Upper Bound on the Rotation Distance of Binary Trees (1989) (35)
Gathering in Dynamic Rings (2017) (29)
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively (2006) (29)
BOTTOM-UP SUBTREE ISOMORPHISM FOR UNORDERED LABELED TREES (2004) (28)
Computing all the best swap edges distributively (2004) (27)
Getting close without touching: near-gathering for autonomous mobile robots (2015) (26)
Three-level logic minimization based on function regularities (2003) (24)
A VLSI Solution to the Vertical Segment Visibility Problem (1986) (23)
Three non Conventional Paradigms of Parallel Computation (1992) (21)
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up (1998) (21)
The p-shovelers problem-computing with time-varying data (1992) (20)
A VLSI tree machine for relational data bases (1983) (20)
Implicit B-trees: New results for the dictionary problem (2002) (19)
Getting Close without Touching (2012) (18)
External Sorting in VLSI (1984) (17)
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures (2012) (16)
A general approach to toroidal mesh decontamination with local immunity (2009) (16)
Network decontamination with local immunization (2006) (15)
Routing in Times Square Mode (1990) (15)
Synthesis of Autosymmetric Functions in a New Three-Level Form (2008) (15)
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays (1993) (14)
Counting the Number of Fault Patterns in Redundant VLSI Arrays (1994) (14)
Approximate Matching for Two Families of Trees (1995) (14)
On the Height of Height-Balanced Trees (1976) (13)
Monotone Dynamos in Tori (1999) (12)
Exploiting Regularities for Boolean Function Synthesis (2006) (12)
Fast three-level logic minimization based on autosymmetry (2002) (12)
Testing and Reconfiguration of VLSI Linear Arrays (1998) (12)
Lower bounds on the rotation distance of binary trees (2010) (12)
A preliminary study of a diagonal channel-routing model (1989) (11)
Channel routing for strictly multiterminal nets (1989) (10)
Web Marshals Fighting Curly Link Farms (2007) (10)
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy (1996) (10)
Implicit B-trees: a new data structure for the dictionary problem (2004) (9)
Simple Solutions for Approximate Tree Matching Problems (1991) (8)
Cops and robber on grids and tori (2017) (8)
A New Heuristic for DSOP Minimization (2008) (8)
More agents may decrease global work: A case in butterfly decontamination (2016) (7)
Distributed Computation of All Node Replacements of a Minimum Spanning Tree (2007) (7)
An Efficient Algorithm for Some Tree Matching Problems (1991) (7)
Optimal Network Decontamination with Threshold Immunity (2013) (7)
A model of sequential computation with Pipelined access to memory (1993) (7)
Network decontamination via local immunization (2006) (7)
Compact DSOP and Partial DSOP Forms (2012) (7)
Implicit Test of Regularity for Not Completely Specified Boolean Functions (2002) (6)
Dense trees: a new look at degenerate graphs (2006) (6)
Self-Adjusting Hash Tables (1985) (6)
Keynotes (2018) (6)
Synthesis of integer multipliers in sum of pseudoproducts form (2003) (6)
Death of a monster (2000) (6)
k-Restricted Rotation with an Application to Search Tree Rebalancing (2005) (6)
Knitting for Fun: A Recursive Sweater (2007) (5)
Network decontamination under m-immunity (2016) (5)
Rebalancing Height Balanced Trees (1978) (5)
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree (2004) (4)
Refined upper bounds for right-arm rotation distances (2007) (4)
Power trees (1978) (4)
k-Restricted rotation distance between binary trees (2007) (4)
Recognition of catastrophic faults (1992) (4)
Compacting and Grouping Mobile Agents on Dynamic Rings (2019) (3)
Capture on Grids and Tori with Different Numbers of Cops (2019) (3)
VLSI algorithms and architecture for relational operations (1989) (3)
Linear Time Distributed Swap Edge Algorithms (2020) (3)
Coding Trees as Strings for Approximate Tree Matching (1993) (3)
Text Sparsification via Local Maxima (2000) (3)
Mathematical and Algorithmic Foundations of the Internet (2011) (3)
VLSI Mesh of Trees for Data Base Processing (1983) (3)
Two Combinatorial Problems on the Layout of Switching Lattices (2018) (3)
String Matching with Weighted Errors (1990) (3)
Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees (2009) (3)
Distributed Computation for Swapping a Failing Edge (2004) (2)
Comment on Generalized AVL Trees (1980) (2)
A 4D CHANNEL ROUTER FOR A 2 LAYER DIAGONAL MODEL (1988) (2)
Computational bounds for the simple and the MRMW PRAM (1994) (2)
Context-dependent string matching (1990) (2)
Masked Interval Routing: A New Routing Scheme (1997) (2)
Compact DSOP Forms Derived from SOP Expressions (2010) (2)
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering (2016) (2)
A versatile interconnection pattern laid on O(n) area (1982) (2)
Routing with the use of masks (1998) (2)
Dense Trees: a new structure forinterconnection (2000) (1)
The Fermat star of binary trees (2009) (1)
The Connection Layout in a Lattice of Four-Terminal Switches (2018) (1)
Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops (2021) (1)
Decomposition of k-Dense Trees (2000) (1)
On formal descriptions for knitting recursive patterns (2008) (1)
Fun at a Department Store: Data Mining Meets Switching Theory (2010) (1)
Interaction between Economic and Computational Problems arising in Internet : A Preliminary Investigation (2002) (1)
Complete Balancing via Rotation (2016) (1)
Height-balanced multiway trees (1979) (1)
The problem of quasi sorting (1979) (0)
The death of the monster 4, 31 (2000) 130-133 (2000) (0)
Three-Level Logic Minimization Based on (2003) (0)
An Insight on PRAM Computational Bounds (1997) (0)
Masked Interval Routing : a New Interval RoutingS heme (0)
Introducing Spacial Graphs (updated version) (1995) (0)
Distributed Construction of Almost-Edge-Disjoint Spanning Trees via (2002) (0)
FUN with Algorithms - Foreword (2002) (0)
Chain rotations: A new look at tree distance (2012) (0)
A Realistic Approach to VLSI Relational Database Processing**This work has been supported by Ministero della Pubblica Istruzione under a research grant. (1985) (0)
Diagonal channel routing with vias at unit distance (1993) (0)
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs (1982) (0)
Brief Announcement: Distributed Swap Edges computation for Minimum Cost Spanning Trees (2009) (0)
Mobile Agents Operating on a Grid: Some Non-conventional Issues in Parallel Computing (2021) (0)
9th International Conference on Fun with Algorithms, FUN 2018, June 13-15, 2018, La Maddalena, Italy (2018) (0)
Computational Bounds for the Simple and MRMV PRAM (1994) (0)
Universit a Di Pisa an Insight on Pram Computational Bounds (1996) (0)
Text Sparsification via Local Maxima Extended Abstract (0)
Some New Results on a Restricted Channel Routing Problem (1986) (0)
Getting close without touching: near-gathering for autonomous mobile robots (2015) (0)
Two New Applications of Dynamos (2002) (0)
Random access in a list environment (1976) (0)
General Restricted Rotation Distance (2004) (0)
Network Decontamination under m-Immunity 1 (2015) (0)
The Nice Properties of a New Boolean Function (1996) (0)
Point-of-Failure Swap Rerouting : Computing The Optimal Swaps Distributively (2005) (0)
A note on optimal allocation of files in a symmetric and homogeneous network (1980) (0)
Dese Trees: A New Structure for Interconnection (1999) (0)
A Rotation Algorithm Based on Induced Equivalent Edges (2014) (0)
The network: A Mathematical and Algorithmic View of the Internet. Libro (2011) (0)
Exact Rooted Subtree Matchingin Sublinear (2001) (0)
Fun with algorithms (2004) (0)
Compact DSOP and Partial DSOP Forms (2013) (0)
Soulmate Algorithms (2015) (0)
Guarding and Searching Polyhedra (2012) (0)
Fast Three-Level Logi Minimization Based on AutosymmetryAnna (2002) (0)
Up-down distance between two trees (2006) (0)
An algorithmic definition of interval with applications to routing (2000) (0)
Literal Selection in Switching Lattice Design (2019) (0)
On the exact complexity of polyomino packing (2018) (0)
From Algorithms to Cryptography (2002) (0)
From the Earth to the Moon: Two Stories of Women and Mathematics (2021) (0)
E-Commerce, Intermediation and Intelligent Software Agents (2002) (0)

This paper list is powered by the following services:

Other Resources About Linda Pagli

en.wikipedia.org

What Schools Are Affiliated With Linda Pagli?

Linda Pagli is affiliated with the following schools: