The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Gianfranco Bilardi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
    Area-Universal Circuits with Constant Slowdown. [Citation Graph (0, 0)][DBLP]
    ARVLSI, 1999, pp:89-98 [Conf]
  2. Gianfranco Bilardi, Franco P. Preparata
    Digital Filtering in VLSI. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:1-11 [Conf]
  3. Gianfranco Bilardi
    Models for parallel and hierarchical computation. [Citation Graph (0, 0)][DBLP]
    Conf. Computing Frontiers, 2007, pp:95-96 [Conf]
  4. Gianfranco Bilardi
    Algorithms and Data Structures for Control Dependence and Related Compiler Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:1-2 [Conf]
  5. Shyam Kapur, Gianfranco Bilardi
    Language Learning from Stochastic Input. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:303-310 [Conf]
  6. Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe
    On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:49-60 [Conf]
  7. Gianfranco Bilardi, Paul Bay
    An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:413-423 [Conf]
  8. Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
    Tight Bounds on Parallel List Marking. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1995, pp:231-242 [Conf]
  9. Gianfranco Bilardi, Bruno Codenotti, G. Del Corso, Maria Cristina Pinotti, Giovanni Resta
    Broadcast and Associative Operations on Fat-Trees. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:196-207 [Conf]
  10. Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs
    Topic 06: Complexity Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2001, pp:332- [Conf]
  11. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci
    A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:543-551 [Conf]
  12. Paul Bay, Gianfranco Bilardi
    Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:297-306 [Conf]
  13. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione
    The Potential of On-Chip Multiprocessing for QCD Machines. [Citation Graph (0, 0)][DBLP]
    HiPC, 2005, pp:386-397 [Conf]
  14. Gianfranco Bilardi, Abha Moitra
    Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:95-107 [Conf]
  15. Gianfranco Bilardi, Enoch Peserico
    A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:128-139 [Conf]
  16. Gianfranco Bilardi, Franco P. Preparata
    The Influence of Key Length on the Area-Time Complexity of Sorting. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:53-62 [Conf]
  17. Mauro Bianco, Gianfranco Bilardi, Francesco Pesavento, Geppino Pucci, Bernhard A. Schrefler
    An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical Problems. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2002, pp:733-742 [Conf]
  18. Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
    On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2001, pp:579-588 [Conf]
  19. Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo
    An International Masters in Software Engineering: Experience and Prospects. [Citation Graph (0, 0)][DBLP]
    ICDE, 1995, pp:556-557 [Conf]
  20. Franco P. Preparata, Gianfranco Bilardi
    Horizons of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    25th Anniversary of INRIA, 1992, pp:155-174 [Conf]
  21. Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
    An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  22. Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    On Stalling in LogP. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:109-115 [Conf]
  23. Gianfranco Bilardi, Alexandru Nicolau, Joseph Hummel
    A Systematic Approach to Branch Speculation. [Citation Graph (0, 0)][DBLP]
    LCPC, 1997, pp:394-411 [Conf]
  24. Gianfranco Bilardi, Keshav Pingali
    Generalized Dominance and Control Dependence. [Citation Graph (0, 0)][DBLP]
    PLDI, 1996, pp:291-300 [Conf]
  25. Keshav Pingali, Gianfranco Bilardi
    APT: A Data Structure for Optimal Control Dependence Computation. [Citation Graph (0, 0)][DBLP]
    PLDI, 1995, pp:32-46 [Conf]
  26. Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
    Optimal organizations for pipelined hierarchical memories. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:109-116 [Conf]
  27. Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis
    BSP vs LogP. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:25-32 [Conf]
  28. Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh
    Optimal VLSI Architectures for Multidimensional DFT. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:265-272 [Conf]
  29. Gianfranco Bilardi, Franco P. Preparata
    Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:185-194 [Conf]
  30. Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
    Computational power of pipelined memory hierarchies. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:144-152 [Conf]
  31. Shyam Kapur, Gianfranco Bilardi
    Language Learning without Overgeneralization. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:245-256 [Conf]
  32. Gianfranco Bilardi, Franco P. Preparata
    A Minimum Area VLSI Network for O(log n) Time Sorting [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:64-70 [Conf]
  33. Gianfranco Bilardi, Franco P. Preparata
    Size-Time Complexity of Boolean Networks for Prefix Computations [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:436-442 [Conf]
  34. Gianfranco Bilardi, Franco P. Preparata
    Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:1-12 [Conf]
  35. Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau
    Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:26-38 [Conf]
  36. Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto
    On the Space and Access Complexity of Computation DAGs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:47-58 [Conf]
  37. Gianfranco Bilardi, Franco P. Preparata
    Area-Time Lower-Bound Techniques with Applications to Sorting. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:65-91 [Journal]
  38. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis
    BSP versus LogP. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:405-422 [Journal]
  39. Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn
    A Lower Bound for Area-Universal Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:2, pp:101-105 [Journal]
  40. Gianfranco Bilardi, Franco P. Preparata
    The VLSI Optimality of the AKS Sorting Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:2, pp:55-59 [Journal]
  41. Shyam Kapur, Gianfranco Bilardi
    On Uniform Learnability of Language Families. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:1, pp:35-38 [Journal]
  42. Gianfranco Bilardi, Keshav Pingali
    Algorithms for computing the static single assignment form. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:3, pp:375-425 [Journal]
  43. Gianfranco Bilardi, Franco P. Preparata
    Size-time complexity of Boolean networks for prefix computations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:2, pp:362-382 [Journal]
  44. Paul Bay, Gianfranco Bilardi
    Deterministic On-Line Routing on Area-Universal Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:3, pp:614-640 [Journal]
  45. Gianfranco Bilardi, Giuseppe F. Italiano
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:1- [Journal]
  46. Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
    Tight Bounds on Parallel List Marking. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:51, n:2, pp:75-88 [Journal]
  47. Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    On stalling in LogP. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:3, pp:307-312 [Journal]
  48. Gianfranco Bilardi, Franco P. Preparata
    Horizons of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:27, n:2, pp:172-182 [Journal]
  49. Gianfranco Bilardi, Xiaolong Jin
    Permutation-Exchange Graphs That Emulate the Binary Cube. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1984, v:17, n:3, pp:193-198 [Journal]
  50. Gianfranco Bilardi, Franco P. Preparata
    Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:6, pp:523-546 [Journal]
  51. Gianfranco Bilardi, Franco P. Preparata
    Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:5, pp:531-559 [Journal]
  52. Gianfranco Bilardi, Alexandru Nicolau
    Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:216-228 [Journal]
  53. Gianfranco Bilardi, Franco P. Preparata
    Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:246-255 [Journal]
  54. Kieran T. Herley, Gianfranco Bilardi
    Deterministic Simulations of PRAMs on Bounded Degree Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:276-292 [Journal]
  55. Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe
    On Bufferless Routing of Variable Length Messages in Leveled Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:6, pp:714-729 [Journal]
  56. Gianfranco Bilardi
    Merging and Sorting Networks with the Topology of the Omega Network. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:10, pp:1396-1403 [Journal]
  57. Gianfranco Bilardi, Franco P. Preparata
    An Architecture for Bitonic Sorting with Optimal VLSI Performance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:7, pp:646-651 [Journal]
  58. Gianfranco Bilardi, Franco P. Preparata
    A Minimum Area VLSI Network for O(log n) Time Sorting. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:4, pp:336-343 [Journal]
  59. Shyam Kapur, Gianfranco Bilardi
    Language Learning Without Overgeneralization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:151-162 [Journal]
  60. Gianfranco Bilardi, Gianfranco Cariolaro, R. Cristi
    Mean value of the output of a discrete-time Volterra system driven by a Markov chain. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:6, pp:838-0 [Journal]
  61. Keshav Pingali, Gianfranco Bilardi
    Optimal Control Dependence Computation and the Roman Chariots Problem. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:3, pp:462-491 [Journal]
  62. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
    Network-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-10 [Conf]

  63. Models for Parallel and Hierarchical On-Chip Computation. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.015secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002