default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan A. Bertossi
Person information
- affiliation: University of Bologna, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[p1]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Time-Optimal Solutions for Uniform Data and Heuristics for Non-Uniform Data. Handbook of Approximation Algorithms and Metaheuristics (2) 2018- 2017
- [j54]Giorgio Audrito
, Alan A. Bertossi, Alfredo Navarra, Maria Cristina Pinotti:
Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks. J. Discrete Algorithms 45: 14-25 (2017) - 2015
- [j53]Alan A. Bertossi, Daniele Diodati, Cristina M. Pinotti:
Storage Placement in Path Networks. IEEE Trans. Computers 64(4): 1201-1207 (2015) - 2011
- [j52]Ferruccio Barsi, Alan A. Bertossi, Christian Lavault, Alfredo Navarra, Stephan Olariu, Maria Cristina Pinotti, Vlady Ravelomanana:
Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks. IEEE Trans. Mob. Comput. 10(3): 377-391 (2011) - [c20]Alan A. Bertossi, Alfredo Navarra, Maria Cristina Pinotti:
Maximum bandwidth broadcast in single and multi-interface networks. ICUIMC 2011: 18 - 2010
- [j51]Paolo Barsocchi, Alan A. Bertossi, Maria Cristina Pinotti, Francesco Potorti:
Allocating data for broadcasting over wireless channels subject to transmission errors. Wirel. Networks 16(2): 355-365 (2010)
2000 – 2009
- 2009
- [j50]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Optimal receiver scheduling algorithms for a multicast problem. Discret. Appl. Math. 157(15): 3187-3197 (2009) - [j49]Ferruccio Barsi, Alan A. Bertossi, Francesco Betti Sorbelli, Roberto Ciotti, Stephan Olariu, Maria Cristina Pinotti:
Asynchronous Corona Training Protocols in Wireless Sensor and Actor Networks. IEEE Trans. Parallel Distributed Syst. 20(8): 1216-1230 (2009) - 2008
- [j48]Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti:
Efficient corona training protocols for sensor networks. Theor. Comput. Sci. 402(1): 2-15 (2008) - [j47]S. Anticaglia, Ferruccio Barsi, Alan A. Bertossi, L. Iamele, Maria Cristina Pinotti:
Efficient heuristics for data broadcasting on multiple channels. Wirel. Networks 14(2): 219-231 (2008) - [c19]Ferruccio Barsi, Alfredo Navarra, Maria Cristina Pinotti, Christian Lavault, Vlady Ravelomanana, Stephan Olariu, Alan A. Bertossi:
Efficient binary schemes for training heterogeneous sensor and actor networks. HeterSanet 2008: 17-24 - 2007
- [j46]Alan A. Bertossi, Maria Cristina Pinotti:
Approximate L(delta1, delta2, ..., deltat)-coloring of trees and interval graphs. Networks 49(3): 204-216 (2007) - [c18]Ferruccio Barsi, Alan A. Bertossi, Francesco Betti Sorbelli, Roberto Ciotti, Stephan Olariu, Maria Cristina Pinotti:
Asynchronous Training in Wireless Sensor Networks. ALGOSENSORS 2007: 46-57 - [c17]Ferruccio Barsi, Francesco Betti Sorbelli, Roberto Ciotti, Maria Cristina Pinotti, Alan A. Bertossi, Stephan Olariu:
Asynchronous training in SANET. Sensor and Actor Networks 2007: 43-50 - [r1]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Scheduling Data Broadcasts on Wireless Channels. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j45]Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti:
Special issue: Algorithms for wireless and ad-hoc networks. J. Parallel Distributed Comput. 66(4): 487-488 (2006) - [j44]Alan A. Bertossi, Azzedine Boukerche, Maria Cristina Pinotti:
Guest Editorial. Wirel. Networks 12(6): 669-670 (2006) - [c16]Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti:
Efficient Training of Sensor Networks. ALGOSENSORS 2006: 1-12 - [c15]Alan A. Bertossi, Luigi V. Mancini, Alessandra Menapace:
Scheduling Hard-Real-Time Tasks with Backup Phasing Delay. DS-RT 2006: 107-118 - [c14]Alan A. Bertossi, Maria Cristina Pinotti:
Skewed allocation of non-uniform data for broadcasting over multiple channels. IPDPS 2006 - 2005
- [j43]Amotz Bar-Noy, Alan A. Bertossi, Maria Cristina Pinotti, Cauligi S. Raghavendra:
Guest Editorial. Mob. Networks Appl. 10(1-2): 7-8 (2005) - [j42]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. IEEE Trans. Computers 54(5): 558-572 (2005) - 2004
- [j41]Alan A. Bertossi, Alessandro Mei:
Time and work optimal simulation of basic reconfigurable meshes on hypercubes. J. Parallel Distributed Comput. 64(1): 173-180 (2004) - [j40]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta:
Allocating servers in infostations for bounded simultaneous requests. J. Parallel Distributed Comput. 64(10): 1113-1126 (2004) - [j39]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende:
Channel assignment for interference avoidance in honeycomb wireless networks. J. Parallel Distributed Comput. 64(12): 1329-1344 (2004) - [j38]Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng:
Classifying Matrices Separating Rows and Columns. IEEE Trans. Parallel Distributed Syst. 15(7): 654-665 (2004) - [c13]Alan A. Bertossi, Maria Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V. S. Shashanka:
Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel. IPDPS 2004 - 2003
- [j37]Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan:
Channel Assignment with Separation for Interference Avoidance in Wireless Networks. IEEE Trans. Parallel Distributed Syst. 14(3): 222-235 (2003) - [c12]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende:
Channel Assignment in Honeycomb Networks. ICTCS 2003: 150-162 - [c11]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta:
Allocating Servers in Infostations for On-Demand Communications. IPDPS 2003: 24 - [c10]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Channel Assignment on Strongly-Simplicial Graphs. IPDPS 2003: 222 - 2002
- [j36]Roberto Battiti, Alan A. Bertossi:
Foreword. Algorithmica 33(1): 1-2 (2002) - [j35]Alan A. Bertossi, Maria Cristina Pinotti:
Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees. J. Parallel Distributed Comput. 62(8): 1314-1333 (2002) - [c9]Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan:
Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings. IPDPS 2002 - 2001
- [j34]Roberto Battiti, Alan A. Bertossi, Silvano Martello:
Editorial. Discret. Appl. Math. 110(1): 1 (2001) - [j33]Roberto Battiti, Alan A. Bertossi, Mauro Brunato:
Cellular Channel Assignment: A New Localized and Distributed Strategy. Mob. Networks Appl. 6(6): 493-500 (2001) - [j32]Roberto Battiti, Alan A. Bertossi, Daniela Cavallaro:
A randomized saturation degree heuristic for channel assignment in cellular radio networks. IEEE Trans. Veh. Technol. 50(2): 364-374 (2001) - 2000
- [j31]Alan A. Bertossi, Alessandro Mei:
Constant Time Dynamic Programming on Directed Reconfigurable Networks. IEEE Trans. Parallel Distributed Syst. 11(6): 529-536 (2000) - [j30]Alan A. Bertossi, Alessandro Mei:
A Residue Number System on Reconfigurable Mesh with Applications to Prefix Sums and Approximate String Matching. IEEE Trans. Parallel Distributed Syst. 11(11): 1186-1199 (2000) - [c8]Alan A. Bertossi, Maria Cristina Pinotti:
Mappings for Conflict-Free Access of Paths in Elementary Data Structures. COCOON 2000: 351-361 - [c7]Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan:
Efficient use of radio spectrum in wireless networks with channel separation between close stations. DIAL-M 2000: 18-27 - [c6]Alan A. Bertossi, Alessandro Mei:
Optimal Segmented Scan and Simulation of Reconfigurable Architectures on Fixed Connection Networks. HiPC 2000: 51-60
1990 – 1999
- 1999
- [j29]Roberto Battiti, Alan A. Bertossi:
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning. IEEE Trans. Computers 48(4): 361-385 (1999) - [j28]Alan A. Bertossi, Luigi V. Mancini, Federico Rossini:
Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems. IEEE Trans. Parallel Distributed Syst. 10(9): 934-945 (1999) - [j27]Roberto Battiti, Alan A. Bertossi, Maurizio A. Bonuccelli:
Assigning codes in wireless networks: bounds and scaling properties. Wirel. Networks 5(3): 195-209 (1999) - 1998
- [c5]Alan A. Bertossi, Alessandro Mei:
New number representation and conversion techniques on reconfigurable mesh. HiPC 1998: 2-10 - 1997
- [j26]Alan A. Bertossi, Alessandro Mei:
P-Bandwidth Priority Queues on Reconfigurable Tree of Meshes. J. Parallel Distributed Comput. 40(2): 248-255 (1997) - [c4]Roberto Battiti, Alan A. Bertossi:
Differential greedy for the 0-1 equicut problem. Network Design: Connectivity and Facilities Location 1997: 3-21 - [c3]Roberto Battiti, Alan A. Bertossi, Romeo Rizzi:
Randomized greedy algorithms for the hypergraph partitioning problem. Randomization Methods in Algorithm Design 1997: 21-35 - [c2]Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancini:
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks. IPPS 1997: 133-138 - 1995
- [j25]Alan A. Bertossi, Massimo Bonometto, Luigi V. Mancini:
Increasing Processor Utilization in Hard-Real-Time Systems with Checkpoints. Real Time Syst. 9(1): 5-29 (1995) - [j24]Alan A. Bertossi, Maurizio A. Bonuccelli:
Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Netw. 3(4): 441-449 (1995) - 1994
- [j23]Alan A. Bertossi, Elena Lodi:
Parallel String Matching with Variable Length Don't Cares. J. Parallel Distributed Comput. 22(2): 229-234 (1994) - [j22]Alan A. Bertossi, Maurizio A. Bonuccelli, Marco Roccetti:
Reconfigurable Tree Architectures for Gracefully Degradable VLSI Systems. J. Parallel Distributed Comput. 23(3): 264-277 (1994) - [j21]Alan A. Bertossi, Luigi V. Mancini:
Scheduling Algorithms for Fault-Tolerance in Hard-Real-Time Systems. Real Time Syst. 7(3): 229-245 (1994) - 1992
- [j20]Alan A. Bertossi, Luigi V. Mancini:
Fault-tolerant LPT task scheduling in multiprocessor systems. Microprocess. Microsystems 16(2): 91-99 (1992) - [c1]Alan A. Bertossi, Maurizio A. Bonuccelli:
Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks. INFOCOM 1992: 701-709 - 1990
- [j19]Alan A. Bertossi:
A VLSI system for string matching. Integr. 9(2): 129-139 (1990) - [j18]Alan A. Bertossi, Sabrina Moretti:
Parallel Algorithms on Circular-Arc Graphs. Inf. Process. Lett. 33(6): 275-281 (1990) - [j17]Alan A. Bertossi, Fabrizio Luccio, Elena Lodi, Linda Pagli:
String Matching with Weighted Errors. Theor. Comput. Sci. 73(3): 319-328 (1990)
1980 – 1989
- 1989
- [j16]Alan A. Bertossi, Maurizio A. Bonuccelli:
A Gracefully Degradable VLSI System for Linear Programming. IEEE Trans. Computers 38(6): 853-861 (1989) - 1988
- [j15]Alan A. Bertossi:
Parallel Circle-Cover Algorithms. Inf. Process. Lett. 27(3): 133-139 (1988) - [j14]Alan A. Bertossi:
On the Domatic Number of Interval Graphs. Inf. Process. Lett. 28(6): 275-280 (1988) - [j13]Alan A. Bertossi, Allessandro Gori:
Total Domination and Irredundance in Weighted Interval Graphs. SIAM J. Discret. Math. 1(3): 317-327 (1988) - 1987
- [j12]Alan A. Bertossi, Maurizio A. Bonuccelli:
Some parallel algorithms on interval graphs. Discret. Appl. Math. 16(2): 101-111 (1987) - [j11]Alan A. Bertossi, Paolo Carraresi, Giorgio Gallo:
On some matching problems arising in vehicle scheduling models. Networks 17(3): 271-281 (1987) - [j10]Alan A. Bertossi, Maurizio A. Bonuccelli:
A VLSI Implementation of the Simplex Algorithm. IEEE Trans. Computers 36(2): 241-247 (1987) - [j9]Alan A. Bertossi, Giancarlo Bongiovanni, Maurizio A. Bonuccelli:
Time Slot Assignment in SS/TDMA Systems with Intersatellite Links. IEEE Trans. Commun. 35(6): 602-608 (1987) - 1986
- [j8]Alan A. Bertossi:
Total Domination in Interval Graphs. Inf. Process. Lett. 23(3): 131-134 (1986) - [j7]Alan A. Bertossi, Maurizio A. Bonuccelli:
Hamiltonian Circuits in Interval Graph Generalizations. Inf. Process. Lett. 23(4): 195-200 (1986) - 1985
- [j6]Alan A. Bertossi, Maurizio A. Bonuccelli:
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors. Discret. Appl. Math. 12(3): 195-201 (1985) - 1984
- [j5]Alan A. Bertossi:
Dominating Sets for Split and Bipartite Graphs. Inf. Process. Lett. 19(1): 37-40 (1984) - 1983
- [j4]Alan A. Bertossi, Maurizio A. Bonuccelli:
Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems. Inf. Process. Lett. 16(1): 3-6 (1983) - [j3]Alan A. Bertossi:
Finding Hamiltonian Circuits in Proper Interval Graphs. Inf. Process. Lett. 17(2): 97-101 (1983) - 1981
- [j2]Alan A. Bertossi:
The Edge Hamiltonian Path Problem is NP-Complete. Inf. Process. Lett. 13(4/5): 157-159 (1981) - 1980
- [j1]Alan A. Bertossi:
On the Complexity of Scheduling Jobs on Dedicated Resources to Minimize Set-Up Costs. Inf. Process. Lett. 10(4/5): 173-177 (1980)
Coauthor Index
aka: Cristina M. Pinotti
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
