The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alan A. Bertossi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti
    Efficient Training of Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:1-12 [Conf]
  2. Alan A. Bertossi, Maria Cristina Pinotti
    Mappings for Conflict-Free Access of Paths in Elementary Data Structures. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:351-361 [Conf]
  3. Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan
    Efficient use of radio spectrum in wireless networks with channel separation between close stations. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2000, pp:18-27 [Conf]
  4. Alan A. Bertossi, Luigi V. Mancini, Alessandra Menapace
    Scheduling Hard-Real-Time Tasks with Backup Phasing Delay. [Citation Graph (0, 0)][DBLP]
    DS-RT, 2006, pp:107-118 [Conf]
  5. Alan A. Bertossi, Alessandro Mei
    Optimal Segmented Scan and Simulation of Reconfigurable Architectures on Fixed Connection Networks. [Citation Graph (0, 0)][DBLP]
    HiPC, 2000, pp:51-60 [Conf]
  6. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende
    Channel Assignment in Honeycomb Networks. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:150-162 [Conf]
  7. Alan A. Bertossi, Maurizio A. Bonuccelli
    Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:701-709 [Conf]
  8. Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancini
    Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:133-138 [Conf]
  9. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi
    Channel Assignment on Strongly-Simplicial Graphs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:222- [Conf]
  10. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta
    Allocating Servers in Infostations for On-Demand Communications. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:24- [Conf]
  11. Alan A. Bertossi, Maria Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V. S. Shashanka
    Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  12. Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan
    Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  13. Alan A. Bertossi, Maria Cristina Pinotti
    Skewed allocation of non-uniform data for broadcasting over multiple channels. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  14. Roberto Battiti, Alan A. Bertossi
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:1, pp:1-2 [Journal]
  15. Roberto Battiti, Alan A. Bertossi, Silvano Martello
    Editorial. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:1, pp:1- [Journal]
  16. Alan A. Bertossi
    On the Complexity of Scheduling Jobs on Dedicated Resources to Minimize Set-Up Costs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:173-177 [Journal]
  17. Alan A. Bertossi
    The Edge Hamiltonian Path Problem is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:157-159 [Journal]
  18. Alan A. Bertossi
    Finding Hamiltonian Circuits in Proper Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:2, pp:97-101 [Journal]
  19. Alan A. Bertossi
    Dominating Sets for Split and Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:37-40 [Journal]
  20. Alan A. Bertossi
    Total Domination in Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:3, pp:131-134 [Journal]
  21. Alan A. Bertossi
    Parallel Circle-Cover Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:3, pp:133-139 [Journal]
  22. Alan A. Bertossi
    On the Domatic Number of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:6, pp:275-280 [Journal]
  23. Alan A. Bertossi, Maurizio A. Bonuccelli
    Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:3-6 [Journal]
  24. Alan A. Bertossi, Maurizio A. Bonuccelli
    Hamiltonian Circuits in Interval Graph Generalizations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:4, pp:195-200 [Journal]
  25. Alan A. Bertossi, Sabrina Moretti
    Parallel Algorithms on Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:6, pp:275-281 [Journal]
  26. Alan A. Bertossi, Maurizio A. Bonuccelli, Marco Roccetti
    Reconfigurable Tree Architectures for Gracefully Degradable VLSI Systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:3, pp:264-277 [Journal]
  27. Alan A. Bertossi, Elena Lodi
    Parallel String Matching with Variable Length Don't Cares. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:22, n:2, pp:229-234 [Journal]
  28. Alan A. Bertossi, Alessandro Mei
    Time and work optimal simulation of basic reconfigurable meshes on hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:1, pp:173-180 [Journal]
  29. Alan A. Bertossi, Alessandro Mei
    P-Bandwidth Priority Queues on Reconfigurable Tree of Meshes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:40, n:2, pp:248-255 [Journal]
  30. Alan A. Bertossi, Maria Cristina Pinotti
    Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:8, pp:1314-1333 [Journal]
  31. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta
    Allocating servers in infostations for bounded simultaneous requests. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:10, pp:1113-1126 [Journal]
  32. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende
    Channel assignment for interference avoidance in honeycomb wireless networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:12, pp:1329-1344 [Journal]
  33. Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti
    Special issue: Algorithms for wireless and ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:4, pp:487-488 [Journal]
  34. Amotz Bar-Noy, Alan A. Bertossi, Maria Cristina Pinotti, Cauligi S. Raghavendra
    Guest Editorial. [Citation Graph (0, 0)][DBLP]
    MONET, 2005, v:10, n:1-2, pp:7-8 [Journal]
  35. Roberto Battiti, Alan A. Bertossi, Mauro Brunato
    Cellular Channel Assignment: A New Localized and Distributed Strategy. [Citation Graph (0, 0)][DBLP]
    MONET, 2001, v:6, n:6, pp:493-500 [Journal]
  36. Alan A. Bertossi, Massimo Bonometto, Luigi V. Mancini
    Increasing Processor Utilization in Hard-Real-Time Systems with Checkpoints. [Citation Graph (0, 0)][DBLP]
    Real-Time Systems, 1995, v:9, n:1, pp:5-29 [Journal]
  37. Alan A. Bertossi, Luigi V. Mancini
    Scheduling Algorithms for Fault-Tolerance in Hard-Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    Real-Time Systems, 1994, v:7, n:3, pp:229-245 [Journal]
  38. Alan A. Bertossi, Allessandro Gori
    Total Domination and Irredundance in Weighted Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:317-327 [Journal]
  39. Elia Ardizzoni, Alan A. Bertossi, Maria Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V. S. Shashanka
    Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:5, pp:558-572 [Journal]
  40. Roberto Battiti, Alan A. Bertossi
    Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1999, v:48, n:4, pp:361-385 [Journal]
  41. Alan A. Bertossi, Maurizio A. Bonuccelli
    A VLSI Implementation of the Simplex Algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:2, pp:241-247 [Journal]
  42. Alan A. Bertossi, Maurizio A. Bonuccelli
    A Gracefully Degradable VLSI System for Linear Programming. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:6, pp:853-861 [Journal]
  43. 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]
  44. Alan A. Bertossi, Maurizio A. Bonuccelli
    Code assignment for hidden terminal interference avoidance in multihop packet radio networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1995, v:3, n:4, pp:441-449 [Journal]
  45. Alan A. Bertossi, Alessandro Mei
    Constant Time Dynamic Programming on Directed Reconfigurable Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:6, pp:529-536 [Journal]
  46. Alan A. Bertossi, Alessandro Mei
    A Residue Number System on Reconfigurable Mesh with Applications to Prefix Sums and Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:11, pp:1186-1199 [Journal]
  47. Alan A. Bertossi, Luigi V. Mancini, Federico Rossini
    Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:9, pp:934-945 [Journal]
  48. Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng
    Classifying Matrices Separating Rows and Columns. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2004, v:15, n:7, pp:654-665 [Journal]
  49. Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan
    Channel Assignment with Separation for Interference Avoidance in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:3, pp:222-235 [Journal]
  50. Roberto Battiti, Alan A. Bertossi, Maurizio A. Bonuccelli
    Assigning codes in wireless networks: bounds and scaling properties. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 1999, v:5, n:3, pp:195-209 [Journal]
  51. Alan A. Bertossi, Azzedine Boukerche, Maria Cristina Pinotti
    Guest Editorial. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:6, pp:669-670 [Journal]

  52. Asynchronous Training in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  53. Asynchronous training in SANET. [Citation Graph (, )][DBLP]


  54. Efficient binary schemes for training heterogeneous sensor and actor networks. [Citation Graph (, )][DBLP]


  55. Optimal receiver scheduling algorithms for a multicast problem. [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