Travelled to:
1 × Italy
1 × United Kingdom
2 × Greece
4 × USA
Collaborated with:
K.Pingali F.P.Preparata E.Peserico A.Moitra Ian Henriksen
Talks about:
time (4) comput (3) network (2) grammar (2) control (2) complex (2) depend (2) deriv (2) sort (2) pars (2)
Person: Gianfranco Bilardi
DBLP: Bilardi:Gianfranco
Contributed to:
Wrote 9 papers:
- CC-2015-PingaliB #context-free grammar #parsing #visual notation
- A Graphical Model for Context-Free Grammar Parsing (KP, GB), pp. 3–27.
- ICALP-2001-BilardiP #locality #memory management
- A Characterization of Temporal Locality and Its Portability across Memory Hierarchies (GB, EP), pp. 128–139.
- PLDI-1996-BilardiP #dependence
- Generalized Dominance and Control Dependence (GB, KP), pp. 291–300.
- PLDI-1995-PingaliB #data type #dependence #named
- APT: A Data Structure for Optimal Control Dependence Computation (KP, GB), pp. 32–46.
- ICALP-1989-BilardiM #bound
- Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions (GB, AM), pp. 95–107.
- STOC-1987-BilardiP #complexity #network
- Size-Time Complexity of Boolean Networks for Prefix Computations (GB, FPP), pp. 436–442.
- ICALP-1985-BilardiP #complexity #sorting
- The Influence of Key Length on the Area-Time Complexity of Sorting (GB, FPP), pp. 53–62.
- STOC-1984-BilardiP #network #sorting
- A Minimum Area VLSI Network for O(log n) Time Sorting (GB, FPP), pp. 64–70.
- OOPSLA-2019-HenriksenBP #approach #parsing
- Derivative grammars: a symbolic approach to parsing with derivatives (IH, GB, KP), p. 28.