Sfoglia per Autore
Random access in a list environment
1976-01-01 Lodi, E.; Luccio, Fabrizio; Pagli, Linda; Santoro, N.
HEIGHT OF HEIGHT-BALANCED TREES
1976-01-01 Luccio, F; Pagli, Linda
REBALANCING HEIGHT BALANCED TREES
1978-01-01 Luccio, F; Pagli, Linda
POWER TREES
1978-01-01 Luccio, F; Pagli, Linda
Meccanizzazione in un Provveditorato agli Studi: Alcuni Algoritmi per il trasferimento dei Professori
1979-01-01 M., Limina; E., Lodi; Luccio, Fabrizio; Occhiuto, MARIA EUGENIA; Pagli, Linda; M., Rubino
HEIGHT-BALANCED MULTIWAY TREES
1979-01-01 Pagli, Linda
The problem of quasi sorting
1979-01-01 Bongiovanni, G.; Luccio, Fabrizio; Pagli, Linda
COMMENT ON GENERALIZED AVL TREES
1980-01-01 Luccio, F; Pagli, Linda
A NOTE ON OPTIMAL ALLOCATION OF FILES IN A SYMMETRIC AND HOMOGENEOUS NETWORK
1980-01-01 Missikoff, M; Pagli, Linda
A LINEAR ALGORITHM TO DETERMINE MINIMAL SPANNING FORESTS IN CHAIN GRAPHS
1982-01-01 Luccio, F; Pagli, Linda
VLSI MESH OF TREES FOR DATA-BASE PROCESSING
1983-01-01 Bonuccelli, MAURIZIO ANGELO; Lodi, E; Luccio, F; Maestrini, P; Pagli, Linda
EXTERNAL SORTING IN VLSI
1984-01-01 Bonuccelli, MAURIZIO ANGELO; Lodi, E; Pagli, Linda
SELF-ADJUSTING HASH-TABLES
1985-01-01 Pagli, Linda
VLSI algorithms and architecture for relational operations
1985-01-01 Bonuccelli, MAURIZIO ANGELO; Lodi, E.; Luccio, F.; Maestrini, P.; Pagli, Linda
SOME NEW RESULTS ON A RESTRICTED CHANNEL ROUTING PROBLEM
1986-01-01 Lodi, E; Pagli, Linda
A VLSI SOLUTION TO THE VERTICAL SEGMENT VISIBILITY PROBLEM
1986-01-01 Lodi, E; Pagli, Linda
A 4D CHANNEL ROUTER FOR A 2 LAYER DIAGONAL MODEL
1988-01-01 Lodi, E; Luccio, F; Pagli, Linda
CHANNEL ROUTING FOR STRICTLY MULTITERMINAL NETS
1989-01-01 Lodi, E; Luccio, F; Pagli, Linda
A PRELIMINARY-STUDY OF A DIAGONAL CHANNEL-ROUTING MODEL
1989-01-01 Lodi, E; Luccio, F; Pagli, Linda
ON THE UPPER BOUND ON THE ROTATION DISTANCE OF BINARY-TREES
1989-01-01 Luccio, F; Pagli, Linda
ROUTING IN TIMES SQUARE MODE
1990-01-01 Lodi, E; Luccio, F; Pagli, Linda
STRING MATCHING WITH WEIGHTED ERRORS
1990-01-01 Bertossi, Aa; Luccio, F; Lodi, E; Pagli, Linda
SIMPLE SOLUTIONS FOR APPROXIMATE TREE MATCHING PROBLEMS
1991-01-01 Luccio, F; Pagli, Linda
AN EFFICIENT ALGORITHM FOR SOME TREE MATCHING PROBLEMS
1991-01-01 Luccio, F; Pagli, Linda
A PARALLEL SOLUTION TO THE APPROXIMATE STRING MATCHING PROBLEM
1992-01-01 Bertossi, Aa; Luccio, F; Pagli, Linda; Lodi, E.
A new model for large memories
1992-01-01 Francese, R.; Pagli, Linda; Parente, D.; Talamo, M.
Coding trees as strings for approximate tree matching
1993-01-01 Grossi, Roberto; F., Luccio; Pagli, Linda
EFFICIENT CONSTRUCTION OF CATASTROPHIC PATTERNS FOR VLSI RECONFIGURABLE ARRAYS
1993-01-01 Nayak, A; Pagli, Linda; Santoro, N.
A MODEL OF SEQUENTIAL-COMPUTATION WITH PIPELINED ACCESS TO MEMORY
1993-01-01 Luccio, F; Pagli, Linda
Diagonal channel routing with vias at unit distance
1993-01-01 Lodi, E.; Luccio, Fabrizio; Pagli, Linda
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Random access in a list environment | 1-gen-1976 | Lodi, E.; Luccio, Fabrizio; Pagli, Linda; Santoro, N. | |
HEIGHT OF HEIGHT-BALANCED TREES | 1-gen-1976 | Luccio, F; Pagli, Linda | |
REBALANCING HEIGHT BALANCED TREES | 1-gen-1978 | Luccio, F; Pagli, Linda | |
POWER TREES | 1-gen-1978 | Luccio, F; Pagli, Linda | |
Meccanizzazione in un Provveditorato agli Studi: Alcuni Algoritmi per il trasferimento dei Professori | 1-gen-1979 | M., Limina; E., Lodi; Luccio, Fabrizio; Occhiuto, MARIA EUGENIA; Pagli, Linda; M., Rubino | |
HEIGHT-BALANCED MULTIWAY TREES | 1-gen-1979 | Pagli, Linda | |
The problem of quasi sorting | 1-gen-1979 | Bongiovanni, G.; Luccio, Fabrizio; Pagli, Linda | |
COMMENT ON GENERALIZED AVL TREES | 1-gen-1980 | Luccio, F; Pagli, Linda | |
A NOTE ON OPTIMAL ALLOCATION OF FILES IN A SYMMETRIC AND HOMOGENEOUS NETWORK | 1-gen-1980 | Missikoff, M; Pagli, Linda | |
A LINEAR ALGORITHM TO DETERMINE MINIMAL SPANNING FORESTS IN CHAIN GRAPHS | 1-gen-1982 | Luccio, F; Pagli, Linda | |
VLSI MESH OF TREES FOR DATA-BASE PROCESSING | 1-gen-1983 | Bonuccelli, MAURIZIO ANGELO; Lodi, E; Luccio, F; Maestrini, P; Pagli, Linda | |
EXTERNAL SORTING IN VLSI | 1-gen-1984 | Bonuccelli, MAURIZIO ANGELO; Lodi, E; Pagli, Linda | |
SELF-ADJUSTING HASH-TABLES | 1-gen-1985 | Pagli, Linda | |
VLSI algorithms and architecture for relational operations | 1-gen-1985 | Bonuccelli, MAURIZIO ANGELO; Lodi, E.; Luccio, F.; Maestrini, P.; Pagli, Linda | |
SOME NEW RESULTS ON A RESTRICTED CHANNEL ROUTING PROBLEM | 1-gen-1986 | Lodi, E; Pagli, Linda | |
A VLSI SOLUTION TO THE VERTICAL SEGMENT VISIBILITY PROBLEM | 1-gen-1986 | Lodi, E; Pagli, Linda | |
A 4D CHANNEL ROUTER FOR A 2 LAYER DIAGONAL MODEL | 1-gen-1988 | Lodi, E; Luccio, F; Pagli, Linda | |
CHANNEL ROUTING FOR STRICTLY MULTITERMINAL NETS | 1-gen-1989 | Lodi, E; Luccio, F; Pagli, Linda | |
A PRELIMINARY-STUDY OF A DIAGONAL CHANNEL-ROUTING MODEL | 1-gen-1989 | Lodi, E; Luccio, F; Pagli, Linda | |
ON THE UPPER BOUND ON THE ROTATION DISTANCE OF BINARY-TREES | 1-gen-1989 | Luccio, F; Pagli, Linda | |
ROUTING IN TIMES SQUARE MODE | 1-gen-1990 | Lodi, E; Luccio, F; Pagli, Linda | |
STRING MATCHING WITH WEIGHTED ERRORS | 1-gen-1990 | Bertossi, Aa; Luccio, F; Lodi, E; Pagli, Linda | |
SIMPLE SOLUTIONS FOR APPROXIMATE TREE MATCHING PROBLEMS | 1-gen-1991 | Luccio, F; Pagli, Linda | |
AN EFFICIENT ALGORITHM FOR SOME TREE MATCHING PROBLEMS | 1-gen-1991 | Luccio, F; Pagli, Linda | |
A PARALLEL SOLUTION TO THE APPROXIMATE STRING MATCHING PROBLEM | 1-gen-1992 | Bertossi, Aa; Luccio, F; Pagli, Linda; Lodi, E. | |
A new model for large memories | 1-gen-1992 | Francese, R.; Pagli, Linda; Parente, D.; Talamo, M. | |
Coding trees as strings for approximate tree matching | 1-gen-1993 | Grossi, Roberto; F., Luccio; Pagli, Linda | |
EFFICIENT CONSTRUCTION OF CATASTROPHIC PATTERNS FOR VLSI RECONFIGURABLE ARRAYS | 1-gen-1993 | Nayak, A; Pagli, Linda; Santoro, N. | |
A MODEL OF SEQUENTIAL-COMPUTATION WITH PIPELINED ACCESS TO MEMORY | 1-gen-1993 | Luccio, F; Pagli, Linda | |
Diagonal channel routing with vias at unit distance | 1-gen-1993 | Lodi, E.; Luccio, Fabrizio; Pagli, Linda |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile