Produzione Scientifica Alan Albert Bertossi


  • A. Montresor, A. Bertossi, Algoritmi e strutture di dati, Torino: Città Studi Edizioni, 2010. - ISBN: 9788825173567 - vedi dettaglio
  • A. Bertossi, C. Pinotti, R. Rizzi, P. Gupta, "Allocating Servers in Infostations for Bounded Simultaneous Requests" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 64, n. 10 (2004), p. 1113-1126. - DOI: 10.1016/j.jpdc.2004.06.003 - vedi dettaglio
  • C. Pinotti, R. Rizzi, A. Bertossi, "Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 64, (2004), p. 1329-1344. - DOI: 10.1016/j.jpdc.2004.06.006 - vedi dettaglio
  • R. Battiti, A. Bertossi, M. Brunato, "Cellular channel assignment: a new localized and distributed algorithm" in JOURNAL ON SPECIAL TOPICS IN MOBILE NETWORKS AND APPLICATIONS, v. 6, n. 6 (2001), p. 493-500 - vedi dettaglio
  • R. Battiti, A. Bertossi, S. Martello (a cura di), "Special issue: Proceedings of the First Conference on Algorithms and Experiments (ALEX98)", Amsterdam ; London ; New York, N.Y.: North-Holland, 2001. - (Discrete Applied Mathematics; 110(1)) - vedi dettaglio
  • A. Bertossi, R. Battiti, D. Cavallaro, "A randomized saturation-degree heuristic for channel assignment in cellular radio networks" in IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, (2000), p. ,-, - vedi dettaglio
  • A. Bertossi, A. Mei, "A residue number system on reconfigurable mesh with applications to prefix sums and approximate string-matching" in IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, (2000), p. ,-, - vedi dettaglio
  • A. Bertossi, Algoritmi e Strutture di Dati, Torino: UTET Libreria, 2000, 600 p - vedi dettaglio
  • A. Bertossi, A. Mei, "Constant time dynamic programming on directed reconfigurable networks" in IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v. 11, (2000), p. 529-536 - vedi dettaglio
  • A. Bertossi, R. Battiti, M. Brunato, "Distributed code assignment in multihop radio networks: object-oriented software simulations" in SoftCOM 2000, Split: FESB-Split, 2000, p. 157-165. - ISBN: 953-6114-37-2. Atti di: IEEE SoftCom 2000, Croazia, Ottobre 2000 - vedi dettaglio
  • A. Bertossi, C. Pinotti, R. Tan, "Efficient Use of Radio Spectrum in Wireless NBetworks with Channel Separation between Close Stations", 2000. Atti di: DIAL M for Mobility; Int'l ACM Workshop on Discrete Algorithms and Methods for Mobile Computing, Boston, 11th August 2000 - vedi dettaglio
  • A. Bertossi, M. C. Pinotti, "Mappings for conflict-free accessing paths in elementary data structures", 2000. Atti di: Sixth Annual Int'l Computing and Combinatorics Conference, Sydney (Australia), 26-28 July 2000 - vedi dettaglio
  • A. Bertossi, A. Mei, "Optimal segmented scan and simulation of reconfigurable architectures on fixed-connection networks", 2000. Atti di: IEEE HiPC 2000, Bangalore (India), Dicembre 2000 - vedi dettaglio
  • R. Battiti, A. Bertossi, D. Cavallaro, "A randomized saturation degree heuristic for channel assignment in cellular radio networks", 1999. - (Preprint UTM; 555), promosso da: Dip. di Matematica - vedi dettaglio
  • R. Battiti, A. Bertossi, A. Bonuccelli, "Assigning codes in wireless networks: bounds and scaling properties" in WIRELESS NETWORKS, v. 5, (1999), p. 195-209 - vedi dettaglio
  • A. Bertossi, L. Mancini, F. Rossini, "Fault-tolerant rate-monotonic first-fit scheduling in hard-real-time systems combining active and passive task replication" in IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v. 10, (1999), p. 934-945 - vedi dettaglio
  • R. Battiti, A. Bertossi, "Greedy, Prohibition and Reactive Heuristics for Graph-Partitioning" in IEEE TRANSACTIONS ON COMPUTERS, v. 48(4), (1999), p. 361-385 - vedi dettaglio
  • A. Bertossi, "On-line operation" in J. Webster (a cura di), Encyclopedia of Electrical and Electronics Engineering, Hoboken, N.J. ; Chichester: Wiley, 1999, p. 146-150 - vedi dettaglio
  • R. Battiti, A. Bertossi, "Differential greedy for the $0$-$1$ equicut problem" in Network Design: Connectivity and Facilites Location, USA: Amer. Math. Soc., Providence, RI, 1998, p. 3-21. Atti di: Network design: connectivity and facilities location, Princeton, NJ, 1997 - vedi dettaglio
  • A. Bertossi, A. Mei, "New number representation and conversion techniques on reconfigurable mesh": IEEE, 1998. Atti di: IEEE High Performance Computing, Madras, Dicembre 1998 - vedi dettaglio
  • R. Battiti, A. Bertossi, R. Rizzi, "Randomized greedy algorithms for the hypergraph partitioning problem": AMS, Providence, 1998, p. 21-35. Atti di: Randomized Methods in Algorithm Design, ,, 1998 - vedi dettaglio
  • A. Bertossi, R. Battiti, R. Rizzi, "Randomized Greedy Algorithms for the Hypergraph Partitioning Problem" in P. Pardalos, S. Rajasekaran, J. Rolim (a cura di), Randomized Methods in Algorithm Design, Providence, R.I.: American mathematical society, 1998, p. 3-21. - (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science; 43) - vedi dettaglio
  • R. Battiti, A. Bertossi, M. Brunato, "Cellular channel assignment: comparing and simplifying heuristics": IEEE, 1997. Atti di: IEEE/ACM Workshop Dial 'M' for Mobility (Discrete algorithms and methods for mobile computing and communications), Budapest, 1 Ottobre 1997 - vedi dettaglio
  • A. Bertossi, R. Battiti, "Differential Greedy for the 0-1 Equicut Problem" in D. Du, P. Pardalos (a cura di), Network Design: Connectivity and Facilities Location, Providence, R.I.: American mathematical society, 1997, p. 3-21. - (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science; 40) - vedi dettaglio
  • A. Bertossi, A. Fusiello, L. Mancini, "Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks": IEEE, 1997. Atti di: IEEE International Parallel Processing Symposium, Ginevra, Aprile 1997 - vedi dettaglio
  • A. Bertossi, A. Mei, "P-bandwidth priority queues on reconfigurable treeof meshes" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 40, (1997), p. 248-255 - vedi dettaglio
  • A. Bertossi, A. Fusiello, "Rate-monotonic scheduling for hard-real-time systems" in EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v. 96, (1997), p. 429-443 - vedi dettaglio
  • A. Bertossi, M. Bonuccelli, "Code assignment for hidden terminalinterference avoidance in multihop packet radio networks" in IEEE-ACM TRANSACTIONS ON NETWORKING, v. 3, (1995), p. 441-449 - vedi dettaglio
  • A. Bertossi, M. Bonometto, L. Mancini, "Increasing processor utilization in hard-real-time systems with checkpoints" in REAL-TIME SYSTEMS, v. 9, (1995), p. 5-29 - vedi dettaglio
  • A. Bertossi, F. Logi, "Parallel string matching with variable lengthdon't cares" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 22, (1994), p. 229-234 - vedi dettaglio
  • A. Bertossi, M. Roccetti, M. Bonnuccelli, "Reconfigurable treearchitectures for gracefully degradable VLSI systems" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 23, (1994), p. 264-277 - vedi dettaglio
  • A. Bertossi, L. Mancini, "Scheduling algorithms for fault-tolerance inhard-real-time systems" in REAL-TIME SYSTEMS, v. 7, (1994), p. 229-245 - vedi dettaglio
  • A. Bertossi, E. Lodi, F. Luccio, L. Pagli, "A parallel solution to the approximate string matching problem" in COMPUTER JOURNAL, v. 35, (1992), p. 524-526 - vedi dettaglio
  • A. Bertossi, L. Mancini, "Fault-tolerant LPT task scheduling in multiprocessor systems" in MICROPROCESSORS AND MICROSYSTEMS, v. 16, (1992), p. 91-100 - vedi dettaglio
  • A. Bertossi, "A VLSI system for string matching" in INTEGRATION, v. 9, (1990), p. 129-139 - vedi dettaglio
  • A. Bertossi, S. Moretti, "Parallel algorithms on circular-arc graphs" in INFORMATION PROCESSING LETTERS, v. 33, (1990), p. 275-281 - vedi dettaglio
  • A. Bertossi, E. Lodi, F. Luccio, L. Pagli, "String matching with weighted errors" in THEORETICAL COMPUTER SCIENCE, v. 73, n. 3 (1990), p. 319-328 - vedi dettaglio
  • A. Bertossi, M. Bonuccelli, "A gracefully degradable VLSI system for linear programming" in IEEE TRANSACTIONS ON COMPUTERS, v. 38, n. 6 (1989), p. 853-861 - vedi dettaglio
  • A. Bertossi, "On the domatic number of interval graphs" in INFORMATION PROCESSING LETTERS, v. 28, (1988), p. 275-280 - vedi dettaglio
  • A. Bertossi, "Parallel circle-cover algorithms" in INFORMATION PROCESSING LETTERS, v. 27, (1988), p. 133-139 - vedi dettaglio
  • A. Bertossi, A. Gori, "Total domination and irredundance in weighted interval graphs" in SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 1, n. 3 (1988), p. 317-327 - vedi dettaglio
  • A. Bertossi, M. Bonuccelli, "A VLSI implementation of the simplex algorithm" in IEEE TRANSACTIONS ON COMPUTERS, v. 36, (1987), p. 241-247 - vedi dettaglio
  • A. Bertossi, P. Carraresi, G. Gallo, "On some matching problems arising in vehicle scheduling models" in NETWORKS, v. 17, n. 3 (1987), p. 271-281 - vedi dettaglio
  • A. Bertossi, M. Bonuccelli, "Some parallel algorithms on interval graphs" in DISCRETE APPLIED MATHEMATICS, v. 16, (1987), p. 101-111 - vedi dettaglio
  • A. Bertossi, G. Bongiovanni, M. Bonuccelli, "Time slot assignment in SS/TDMA systems with intersatellite links" in IEEE TRANSACTIONS ON COMMUNICATIONS, v. 35, (1987), p. 602-608 - vedi dettaglio
  • A. Bertossi, M. Bonuccelli, "Hamiltonian circuits in interval graph generalizations" in INFORMATION PROCESSING LETTERS, v. 23, (1986), p. 195-200 - vedi dettaglio
  • A. Bertossi, "Total domination in interval graphs" in INFORMATION PROCESSING LETTERS, v. 23, (1986), p. 131-134 - vedi dettaglio
  • A. Bertossi, M. Bonuccelli, "A polynomial feasibility test for preemptive periodic scheduling of unrelated processors" in DISCRETE APPLIED MATHEMATICS, v. 12, (1985), p. 195-201 - vedi dettaglio
  • A. Bertossi, "Dominating sets for split and bipartite graphs" in INFORMATION PROCESSING LETTERS, v. 19, (1984), p. 37-40 - vedi dettaglio
  • A. Bertossi, "Finding Hamiltonian circuits in proper interval graphs" in INFORMATION PROCESSING LETTERS, v. 17, (1983), p. 97-101 - vedi dettaglio
  • A. Bertossi, M. Bonuccelli, "Preemptive scheduling of periodic jobs in uniform multiprocessor systems" in INFORMATION PROCESSING LETTERS, v. 16, (1983), p. 3-6 - vedi dettaglio
  • A. Bertossi, "The edge Hamiltonian path problem is NP-complete" in INFORMATION PROCESSING LETTERS, v. 13, (1981), p. 157-159 - vedi dettaglio
  • A. Bertossi, "On the complexity of scheduling jobs on dedicated resources to minimize set-up costs" in INFORMATION PROCESSING LETTERS, v. 10, (1980), p. 173-177 - vedi dettaglio