|
Search the dblp DataBase
Giorgio Gambosi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Giorgio Gambosi, Enrico Nardelli, Maurizio Talamo
A Conceptual Model for the Representation of Statistical Data in Geographical Information Systems. [Citation Graph (2, 3)][DBLP] SSDBM, 1988, pp:278-290 [Conf]
- Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna
On-line algorithms for the channel assignment problem in cellular networks. [Citation Graph (0, 0)][DBLP] DIAL-M, 2000, pp:1-7 [Conf]
- Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's. [Citation Graph (0, 0)][DBLP] ESA, 1994, pp:343-353 [Conf]
- Michele Flammini, Giorgio Gambosi, Alessandro Gasparini, Alfredo Navarra
Dynamic Layouts for Wireless ATM. [Citation Graph (0, 0)][DBLP] Euro-Par, 2003, pp:1056-1063 [Conf]
- Giorgio Gambosi, Marco Protasi, Maurizio Talamo
An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests. [Citation Graph (0, 0)][DBLP] FSTTCS, 1989, pp:252-266 [Conf]
- Edgardo Ambrosi, Marco Bianchi, Carlo Gaibisso, Giorgio Gambosi
A Description Logic based Grid Inferential Monitoring and Discovery Framework. [Citation Graph (0, 0)][DBLP] GCA, 2005, pp:18-23 [Conf]
- Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
Online Load Balancing Made Simple: Greedy Strikes Back. [Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:1108-1122 [Conf]
- Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo
Posets, Boolean Representations and Quick Path Searching. [Citation Graph (0, 0)][DBLP] ICALP, 1987, pp:404-424 [Conf]
- Giorgio Gambosi, Enrico Nardelli, Maurizio Talamo
A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps. [Citation Graph (0, 0)][DBLP] ICALP, 1989, pp:405-422 [Conf]
- Michele Flammini, Giorgio Gambosi, Alfredo Navarra
Wireless ATM Layouts for Chain Networks. [Citation Graph (0, 0)][DBLP] IPDPS, 2003, pp:220- [Conf]
- Edgardo Ambrosi, Marco Bianchi, Carlo Gaibisso, Giorgio Gambosi, Flavio Lombardi
Transparent Java Threads Migration Protocol over Peer2Peer. [Citation Graph (0, 0)][DBLP] ISPA, 2005, pp:972-983 [Conf]
- Edgardo Ambrosi, Marco Bianchi, Carlo Gaibisso, Giorgio Gambosi, Flavio Lombardi
Extending the UDDI API for service instance ranking. [Citation Graph (0, 0)][DBLP] ISWS, 2005, pp:104-110 [Conf]
- Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
Characterization results of all shortest paths interval routing schemes. [Citation Graph (0, 0)][DBLP] SIROCCO, 1998, pp:201-213 [Conf]
- Michele Flammini, Giorgio Gambosi, Sandro Salomone
Interval Labeling Scheme for Chordal Rings. [Citation Graph (0, 0)][DBLP] SIROCCO, 1994, pp:111-124 [Conf]
- Michele Flammini, Giorgio Gambosi, Sandro Salomone
Interval Routing Schemes. [Citation Graph (0, 0)][DBLP] STACS, 1995, pp:279-290 [Conf]
- Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
Getting Back to the Past in the Union-Find Problem. [Citation Graph (0, 0)][DBLP] STACS, 1988, pp:8-17 [Conf]
- Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo
Efficient Representation of Taxonomies. [Citation Graph (0, 0)][DBLP] TAPSOFT, Vol.1, 1987, pp:232-240 [Conf]
- Giorgio Gambosi, Paola Vocca
Topological Routing Schemes. [Citation Graph (0, 0)][DBLP] WDAG, 1996, pp:206-219 [Conf]
- Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
Multi-Dimensional Interval Routing Schemes. [Citation Graph (0, 0)][DBLP] WDAG, 1995, pp:131-144 [Conf]
- Michele Flammini, Giorgio Gambosi, Sandro Salomone
Boolean Routing. [Citation Graph (0, 0)][DBLP] WDAG, 1993, pp:219-233 [Conf]
- Michele Flammini, Giorgio Gambosi, Sandro Salomone
On Devising Boolean Routing Schemes. [Citation Graph (0, 0)][DBLP] WG, 1995, pp:222-236 [Conf]
- Michele Flammini, Giorgio Gambosi, Sandro Salomone
Interval Routing Schemes. [Citation Graph (0, 0)][DBLP] Algorithmica, 1996, v:16, n:6, pp:549-568 [Journal]
- Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
The Set Union Problem with Dynamic Weighted Backtracking. [Citation Graph (0, 0)][DBLP] BIT, 1991, v:31, n:3, pp:383-393 [Journal]
- Giorgio Gambosi, Marco Protasi, Maurizio Talamo
An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets. [Citation Graph (0, 0)][DBLP] BIT, 1993, v:33, n:1, pp:29-45 [Journal]
- Pilu Crescenzi, Giorgio Gambosi, Paolo Penna
On-line algorithms for the channel assignment problem in cellular networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:137, n:3, pp:237-266 [Journal]
- Giorgio Gambosi, Marco Protasi, Maurizio Talamo
Preserving Approximation in the Min-Weighted Set Cover Problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:73, n:1, pp:13-22 [Journal]
- Giorgio Gambosi, Alberto Postiglione, Maurizio Talamo
On the average performanve of some algorithms for one-line-packing. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1990, v:41, n:, pp:202-209 [Journal]
- Paolo Giulio Franciosa, Carlo Gaibisso, Giorgio Gambosi, Maurizio Talamo
A convex hull algorithm for points with approximately known positions. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1994, v:4, n:2, pp:153-163 [Journal]
- Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:2, pp:113-120 [Journal]
- Giorgio Gambosi, Gaia Nicosia
On-line scheduling with setup costs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:73, n:1-2, pp:61-68 [Journal]
- Carlo Gaibisso, Giorgio Gambosi, Maurizio Talamo
A partially persistent data structure for the set-union problem. [Citation Graph (0, 0)][DBLP] ITA, 1990, v:24, n:, pp:189-204 [Journal]
- Maurizio Talamo, Giorgio Gambosi
An Application of m-Ary Trees to The Design of Data Structures for Geometric Searching Problems. [Citation Graph (0, 0)][DBLP] ITA, 1989, v:23, n:2, pp:165-176 [Journal]
- Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
On-line load balancing made simple: Greedy strikes back. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2007, v:5, n:1, pp:162-175 [Journal]
- Michele Flammini, Giorgio Gambosi, Alfredo Navarra
Wireless ATM Layouts for Chain Networks. [Citation Graph (0, 0)][DBLP] MONET, 2005, v:10, n:1-2, pp:35-45 [Journal]
- Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
Characterization results of all shortest paths interval routing schemes. [Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:4, pp:225-232 [Journal]
- Giorgio Gambosi, Alberto Postiglione, Maurizio Talamo
On-Line Maintenance of an Approximate Bin-Packing Solution. [Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1997, v:4, n:2, pp:151-166 [Journal]
- Alberto Apostolico, Giuseppe F. Italiano, Giorgio Gambosi, Maurizio Talamo
The Set Union Problem With Unlimited Backtracking. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:1, pp:50-70 [Journal]
- Giorgio Gambosi, Alberto Postiglione, Maurizio Talamo
Algorithms for the Relaxed Online Bin-Packing Model. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:5, pp:1532-1551 [Journal]
- Jacek Blazewicz, Daniel P. Bovet, J. Brzezinski, Giorgio Gambosi, Maurizio Talamo
Optimal Centralized Algorithms for Store-and-Forward Deadlock Avoidance. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1994, v:43, n:11, pp:1333-1338 [Journal]
- Luca Becchetti, Paola Bertolazzi, Carlo Gaibisso, Giorgio Gambosi
On the design of efficient ATM routing schemes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:341-359 [Journal]
- Gian Carlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi
Foreword. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:285, n:1, pp:1- [Journal]
- Michele Flammini, Giorgio Gambosi
On Devising Boolean Routing Schemes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:186, n:1-2, pp:171-198 [Journal]
- Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
Multidimensional Interval Routing Schemes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:205, n:1-2, pp:115-133 [Journal]
- Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
Worst-Case Analysis of the Set-Union Problem with Extended Backtracking. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1989, v:68, n:1, pp:57-70 [Journal]
- Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo
On Locally Presented Posets. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:70, n:2, pp:251-260 [Journal]
- Giorgio Gambosi, Enrico Nardelli, Maurizio Talamo
A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:84, n:1, pp:107-126 [Journal]
- Pilu Crescenzi, Giorgio Gambosi, Gaia Innocenti
NetPrIDE an integrated environment for developing and visualizing computer network protocols. [Citation Graph (0, 0)][DBLP] ITiCSE, 2005, pp:306-310 [Conf]
A Support System for the Analysis and the Management of Complex Ruling Documents. [Citation Graph (, )][DBLP]
Automatic Construction of an Opinion-Term Vocabulary for Ad Hoc Retrieval. [Citation Graph (, )][DBLP]
On performance of topical opinion retrieval. [Citation Graph (, )][DBLP]
CNIPA, FUB and University of Rome "Tor Vergata" at TREC 2008 Legal Track. [Citation Graph (, )][DBLP]
FUB, IASI-CNR and University of Tor Vergata at TREC 2008 Blog Track. [Citation Graph (, )][DBLP]
FUB, IASI-CNR and University of Tor Vergata at TREC 2007 Blog Track. [Citation Graph (, )][DBLP]
A Study on Evaluation on Opinion Retrieval Systems. [Citation Graph (, )][DBLP]
Search in 0.178secs, Finished in 0.181secs
|