The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Linda Pagli: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Linda Pagli
    Height-balanced multiway trees. [Citation Graph (1, 0)][DBLP]
    Inf. Syst., 1979, v:4, n:1, pp:227-234 [Journal]
  2. Elena Lodi, Fabrizio Luccio, Linda Pagli
    A 4D Channel Router for a Two Layer Diagonal Model. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:465-476 [Conf]
  3. Elena Lodi, Linda Pagli
    Some New Results on a Restricted Channel Routing Problem. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:133-143 [Conf]
  4. Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli
    VLSI Mesh of Trees for Data Base Processing. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:155-166 [Conf]
  5. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
    Fast three-level logic minimization based on autosymmetry. [Citation Graph (0, 0)][DBLP]
    DAC, 2002, pp:425-430 [Conf]
  6. Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
    Implicit B-Trees: New Results for the Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:145-154 [Conf]
  7. Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
    Text Sparsification via Local Maxima. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:290-301 [Conf]
  8. Davide Gualerzi, Elena Lodi, Linda Pagli
    E-Commerce, Intermediation and Intelligent Software Agents. [Citation Graph (0, 0)][DBLP]
    ICWI, 2002, pp:515-519 [Conf]
  9. Amiya Nayak, Linda Pagli, Nicola Santoro
    Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:79-83 [Conf]
  10. Paola Flocchini, Antonio Mesa Enriques, Linda Pagli, Giuseppe Prencipe, Nicola Santoro
    Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:153-166 [Conf]
  11. Fabrizio Luccio, Linda Pagli, Nicola Santoro
    Network decontamination with local immunization. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  12. Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli
    A VLSI Tree Machine for Relational Data Bases [Citation Graph (0, 0)][DBLP]
    ISCA, 1983, pp:67-73 [Conf]
  13. Linda Pagli, Giuseppe Prencipe, Tranos Zuva
    Distributed Computation for Swapping a Failing Edge. [Citation Graph (0, 0)][DBLP]
    IWDC, 2004, pp:28-39 [Conf]
  14. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
    Implicit Test of Regularity for Not Completely Specified Boolean Functions. [Citation Graph (0, 0)][DBLP]
    IWLS, 2002, pp:345-350 [Conf]
  15. Fabrizio Luccio, Linda Pagli
    From Algorithms to Cryptography. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:15- [Conf]
  16. Fabrizio Luccio, Linda Pagli, Geppino Pucci
    Three non Conventional Paradigms of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:166-175 [Conf]
  17. Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva
    Computing All the Best Swap Edges Distributively. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2004, pp:154-168 [Conf]
  18. Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro
    Monotone Dynamos in Tori. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:152-165 [Conf]
  19. Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli
    Routing with the use of masks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:188-200 [Conf]
  20. Fabrizio Luccio, Linda Pagli
    An algorithmic definition of interval with applications to routing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:227-236 [Conf]
  21. Fabrizio Luccio, Linda Pagli
    Two New Applications of Dynamos. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:247-258 [Conf]
  22. Fabrizio Luccio, Linda Pagli, Hermineh Sanossian
    Irreversible Dynamos in Butterflies. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:204-218 [Conf]
  23. Fabrizio Luccio, Linda Pagli
    The p-Shovelers Problem (Computing with Time-Varying Data). [Citation Graph (0, 0)][DBLP]
    SPDP, 1992, pp:188-193 [Conf]
  24. Fabrizio Luccio, Linda Pagli
    Simple Solutions for Approximate Tree Matching Problems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:193-201 [Conf]
  25. Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli
    k-Restricted Rotation with an Application to Search Tree Rebalancing. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:2-13 [Conf]
  26. Fabrizio Luccio, Linda Pagli
    Dese Trees: A New Structure for Interconnection. [Citation Graph (0, 0)][DBLP]
    WDAS, 1999, pp:56-72 [Conf]
  27. Lino Flores Pacheco, Gianni Franceschini, Fabrizio Luccio, Linda Pagli
    Decomposition of k-Dense Trees. [Citation Graph (0, 0)][DBLP]
    WDAS, 2000, pp:11-23 [Conf]
  28. Elena Lodi, Fabrizio Luccio, Linda Pagli
    A Preliminary Study of a Diagonal Channel-Routing Model. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:585-597 [Journal]
  29. Fabrizio Luccio, Linda Pagli
    Power Trees. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:11, pp:941-947 [Journal]
  30. Fabrizio Luccio, Linda Pagli
    Comment on Generalized AVL Trees. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1980, v:23, n:7, pp:394-395 [Journal]
  31. Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli
    Masked Interval Routing: A New Routing Scheme. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2000, v:43, n:2, pp:121-129 [Journal]
  32. Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro
    Dynamic monopolies in tori. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:2, pp:197-212 [Journal]
  33. Elena Lodi, Linda Pagli, Nicola Santoro
    Fun with algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:229-230 [Journal]
  34. Fabrizio Luccio, Linda Pagli
    Approximate Matching for Two Families of Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:111-120 [Journal]
  35. Valentina Ciriani, Fabrizio Luccio, Linda Pagli
    Synthesis of integer multipliers in sum of pseudoproducts form. [Citation Graph (0, 0)][DBLP]
    Integration, 2003, v:36, n:3, pp:103-119 [Journal]
  36. Elena Lodi, Fabrizio Luccio, Linda Pagli
    Routing in Times Square Mode. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:1, pp:41-48 [Journal]
  37. Fabrizio Luccio, Linda Pagli
    A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:1, pp:1-4 [Journal]
  38. Fabrizio Luccio, Linda Pagli
    On the Upper Bound on the Rotation Distance of Binary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:2, pp:57-60 [Journal]
  39. Fabrizio Luccio, Linda Pagli
    An Efficient Algorithm for Some Tree Matching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:1, pp:51-57 [Journal]
  40. Fabrizio Luccio, Linda Pagli
    An Insight on PRAM Computational Bounds. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:6, pp:331-336 [Journal]
  41. Linda Pagli
    Self-Adjusting Hash Tables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:1, pp:23-25 [Journal]
  42. Linda Pagli, Geppino Pucci
    Counting the Number of Fault Patterns in Redundant VLSI Arrays. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:6, pp:337-342 [Journal]
  43. Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli
    k-Restricted rotation distance between binary trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:5, pp:175-180 [Journal]
  44. Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro
    Random access in a list environment. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1976, v:2, n:1, pp:11-17 [Journal]
  45. Michele Missikoff, Linda Pagli
    A note on optimal allocation of files in a symmetric and homogeneous network. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1980, v:5, n:2, pp:149-150 [Journal]
  46. Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
    Implicit B-trees: a new data structure for the dictionary problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:788-807 [Journal]
  47. Gianni Franceschini, Fabrizio Luccio, Linda Pagli
    Dense trees: a new look at degenerate graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:455-474 [Journal]
  48. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
    Exploiting Regularities for Boolean Function Synthesis. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:4, pp:485-501 [Journal]
  49. Fabrizio Luccio, Linda Pagli
    A Model of Sequential Computation with Pipelines Access to Memory. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:4, pp:343-356 [Journal]
  50. Fabrizio Luccio, Linda Pagli
    Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:1, pp:5-26 [Journal]
  51. Maurizio A. Bonuccelli, Elena Lodi, Linda Pagli
    External Sorting in VLSI. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:10, pp:931-934 [Journal]
  52. Elena Lodi, Linda Pagli
    A VLSI Solution to the Vertical Segment Visibility Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1986, v:35, n:10, pp:923-928 [Journal]
  53. Fabrizio Luccio, Linda Pagli
    On the Height of Height-Balanced Trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:1, pp:87-91 [Journal]
  54. Fabrizio Luccio, Linda Pagli
    Rebalancing Height Balanced Trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1978, v:27, n:5, pp:386-396 [Journal]
  55. Fabrizio Luccio, Linda Pagli
    On a New Boolean Function with Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1999, v:48, n:3, pp:296-310 [Journal]
  56. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
    Three-level logic minimization based on function regularities. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2003, v:22, n:8, pp:1005-1016 [Journal]
  57. Alan A. Bertossi, Fabrizio Luccio, Elena Lodi, Linda Pagli
    String Matching with Weighted Errors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:319-328 [Journal]
  58. Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
    Text sparsification via local maxima. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:341-364 [Journal]
  59. Elena Lodi, Linda Pagli, Nicola Santoro
    FUN with Algorithms - Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:282, n:2, pp:221-222 [Journal]
  60. Roberto De Prisco, Angelo Monti, Linda Pagli
    Testing and Reconfiguration of VLSI Linear Arrays. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:171-188 [Journal]
  61. Sean Cleary, Fabrizio Luccio, Linda Pagli
    Refined upper bounds for right-arm rotation distances. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:277-281 [Journal]
  62. Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, Giuseppe Prencipe, Nicola Santoro
    Distributed Computation of All Node Replacements of a Minimum Spanning Tree. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2007, pp:598-607 [Conf]
  63. Anna Bernasconi, Chiara Bodei, Linda Pagli
    Knitting for Fun: A Recursive Sweater. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:53-65 [Conf]
  64. Fabrizio Luccio, Linda Pagli
    Web Marshals Fighting Curly Link Farms. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:240-248 [Conf]

  65. A general approach to toroidal mesh decontamination with local immunity. [Citation Graph (, )][DBLP]


  66. Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees. [Citation Graph (, )][DBLP]


  67. Fun at a Department Store: Data Mining Meets Switching Theory. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002