2009 | ||
---|---|---|
81 | EE | Ferruccio Barsi, Alfredo Navarra, Maria Cristina Pinotti: Cheapest Paths in Multi-interface Networks. ICDCN 2009: 37-42 |
2008 | ||
80 | EE | 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 |
79 | EE | Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Connectivity in Multi-interface Networks. TGC 2008: 157-170 |
78 | EE | Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti: Efficient corona training protocols for sensor networks. Theor. Comput. Sci. 402(1): 2-15 (2008) |
77 | EE | S. Anticaglia, Ferruccio Barsi, Alan A. Bertossi, L. Iamele, Maria Cristina Pinotti: Efficient heuristics for data broadcasting on multiple channels. Wireless Networks 14(2): 219-231 (2008) |
2007 | ||
76 | EE | 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 |
75 | EE | 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 |
74 | EE | Alan A. Bertossi, Maria Cristina Pinotti: Approximate L(delta1, delta2, ..., deltat)-coloring of trees and interval graphs. Networks 49(3): 204-216 (2007) |
73 | EE | Yu-Chee Tseng, Wen-Chih Peng, Victor C. M. Leung, Wen-Tsuen Chen, Maria Cristina Pinotti: Information processing and data management in wireless sensor networks. Signal Processing 87(12): 2859-2860 (2007) |
2006 | ||
72 | EE | Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti: Efficient Training of Sensor Networks. ALGOSENSORS 2006: 1-12 |
71 | EE | Alan A. Bertossi, Maria Cristina Pinotti: Skewed allocation of non-uniform data for broadcasting over multiple channels. IPDPS 2006 |
70 | EE | Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti: Special issue: Algorithms for wireless and ad-hoc networks. J. Parallel Distrib. Comput. 66(4): 487-488 (2006) |
69 | EE | Alan A. Bertossi, Azzedine Boukerche, Maria Cristina Pinotti: Guest Editorial. Wireless Networks 12(6): 669-670 (2006) |
2005 | ||
68 | EE | Navrati Saxena, Kalyan Basu, Sajal K. Das, Maria Cristina Pinotti: A New Service Classification Strategy in Hybrid Scheduling to Support Differentiated QoS in Wireless Data Networks. ICPP 2005: 389-396 |
67 | EE | Navrati Saxena, Kalyan Basu, Sajal K. Das, Maria Cristina Pinotti: A Dynamic Hybrid Scheduling Algorithm with Clients' Departure for Impatient Clients in Heterogeneous Environments. IPDPS 2005 |
66 | EE | Navrati Saxena, Maria Cristina Pinotti: On-line balanced k-channel data allocation with hybrid schedule per channel. Mobile Data Management 2005: 239-246 |
65 | EE | Navrati Saxena, Maria Cristina Pinotti, Kalyan Basu, Sajal K. Das: A New Hybrid Scheduling Framework for Asymmetric Wireless Environments with Request Repetition. WiOpt 2005: 368-376 |
64 | EE | 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) |
63 | EE | Amotz Bar-Noy, Alan A. Bertossi, Maria Cristina Pinotti, Cauligi S. Raghavendra: Guest Editorial. MONET 10(1-2): 7-8 (2005) |
62 | EE | Navrati Saxena, Maria Cristina Pinotti, Kalyan Basu, Sajal K. Das: A dynamic hybrid scheduling algorithm for heterogeneous asymmetric environments. Parallel Algorithms Appl. 20(3-4): 185-204 (2005) |
61 | EE | Azzedine Boukerche, Trivikram Dash, Maria Cristina Pinotti: Performance analysis of a novel hybrid push-pull algorithm with QoS adaptations in wireless networks. Perform. Eval. 60(1-4): 201-221 (2005) |
2004 | ||
60 | EE | 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 |
59 | EE | Azzedine Boukerche, Trivikram Dash, Maria Cristina Pinotti: Performance analysis of a hybrid push-pull algorithm with QoS adaptations in wireless networks. ISCC 2004: 512-524 |
58 | Navrati Saxena, Maria Cristina Pinotti: Performance Guarantee in a New Hybrid Push-Pull Scheduling Algorithm. Wireless Information Systems 2004: 50-62 | |
57 | EE | Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: Classifying Matrices Separating Rows and Columns. IEEE Trans. Parallel Distrib. Syst. 15(7): 654-665 (2004) |
56 | EE | Giuseppe Lancia, Maria Cristina Pinotti, Romeo Rizzi: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms. INFORMS Journal on Computing 16(4): 348-359 (2004) |
55 | EE | Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta: Allocating servers in infostations for bounded simultaneous requests. J. Parallel Distrib. Comput. 64(10): 1113-1126 (2004) |
54 | EE | Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende: Channel assignment for interference avoidance in honeycomb wireless networks. J. Parallel Distrib. Comput. 64(12): 1329-1344 (2004) |
2003 | ||
53 | EE | Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende: Channel Assignment in Honeycomb Networks. ICTCS 2003: 150-162 |
52 | EE | Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi: Channel Assignment on Strongly-Simplicial Graphs. IPDPS 2003: 222 |
51 | EE | Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta: Allocating Servers in Infostations for On-Demand Communications. IPDPS 2003: 24 |
50 | EE | Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan: Channel Assignment with Separation for Interference Avoidance in Wireless Networks. IEEE Trans. Parallel Distrib. Syst. 14(3): 222-235 (2003) |
2002 | ||
49 | EE | Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan: Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings. IPDPS 2002 |
48 | EE | Maria Cristina Pinotti, Navrati Saxena: Push Less and Pull the Current Highest Demanded Data Item to Decrease the Waiting Time in Asymmetric Communication Environments. IWDC 2002: 203-213 |
47 | Stephan Olariu, Maria Cristina Pinotti, Larry Wilson: Greedy algorithms for tracking mobile users in special mobility graphs. Discrete Applied Mathematics 121(1-3): 215-227 (2002) | |
46 | EE | Sajal K. Das, Maria Cristina Pinotti: Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multidimensional Files. IEEE Trans. Parallel Distrib. Syst. 13(12): 1211-1219 (2002) |
45 | EE | Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Maria Cristina Pinotti, Vittorio Scarano: Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems. IEEE Trans. Parallel Distrib. Syst. 13(4): 399-412 (2002) |
44 | EE | Alan A. Bertossi, Maria Cristina Pinotti: Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees. J. Parallel Distrib. Comput. 62(8): 1314-1333 (2002) |
2001 | ||
43 | Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Maria Cristina Pinotti, Vittorio Scarano: Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems. IPDPS 2001: 35 | |
42 | EE | Yufei Guo, Sajal K. Das, Maria Cristina Pinotti: A new hybrid broadcast scheduling algorithm for asymmetric communication systems: push and pull data based on optimal cut-off point. MSWiM 2001: 123-130 |
41 | EE | Si-Qing Zheng, Keqin Li, Yi Pan, Maria Cristina Pinotti: Generalized Coincident Pulse Technique and New Addressing Schemes for Time-Division Multiplexing Optical Buses. J. Parallel Distrib. Comput. 61(8): 1033-1051 (2001) |
40 | EE | Yufei Guo, Maria Cristina Pinotti, Sajal K. Das: A new hybrid broadcast scheduling algorithm for asymmetric communication systems. Mobile Computing and Communications Review 5(3): 39-54 (2001) |
39 | EE | Gerth Stølting Brodal, Maria Cristina Pinotti: Comparator networks for binary heap construction. Theor. Comput. Sci. 250(1-2): 235-245 (2001) |
2000 | ||
38 | EE | Alan A. Bertossi, Maria Cristina Pinotti: Mappings for Conflict-Free Access of Paths in Elementary Data Structures. COCOON 2000: 351-361 |
37 | EE | 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 |
36 | EE | Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device. IEEE Trans. Computers 49(12): 1310-1324 (2000) |
35 | EE | Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya: Scalable Hardware-Algorithms for Binary Prefix Sums. IEEE Trans. Parallel Distrib. Syst. 11(8): 838-850 (2000) |
34 | Sajal K. Das, Maria Cristina Pinotti: Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates. J. Parallel Distrib. Comput. 60(8): 998-1027 (2000) | |
33 | Sajal K. Das, Maria Cristina Pinotti: Parallel priority queues based on binomial heaps. Parallel Computing 26(11): 1411-1428 (2000) | |
1999 | ||
32 | Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: An Optimal Hardware-Algorithm for Selection Using a Fixed-Size Parallel Classifier Device. HiPC 1999: 284-288 | |
31 | EE | Sajal K. Das, Maria Cristina Pinotti: A Strictly-Optimal Strategy to Access Multi-Dimensional Data on Parallel Disk Systems. ICPP 1999: 120-127 |
30 | EE | Sajal K. Das, Maria Cristina Pinotti: An Optimal Disk Allocation Strategy for Partial Match Queries on Non-Uniform Cartesian Product Files. IPPS/SPDP 1999: 550-554 |
29 | Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya: Scalable Hardware-Algorithms for Binary Prefix Sums. IPPS/SPDP Workshops 1999: 634-642 | |
28 | Sajal K. Das, Maria Cristina Pinotti: Conflict-Free Access to Subcubes of Mixed-Radix Hypercubes. WDAS 1999: 17-24 | |
27 | EE | Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: How to Sort N Items Using a Sorting Network of Fixed I/O Size. IEEE Trans. Parallel Distrib. Syst. 10(5): 487-499 (1999) |
1998 | ||
26 | EE | Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya: A Scalable VLSI Architecture for Binary Prefix Sums. IPPS/SPDP 1998: 333-337 |
25 | EE | Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Maria Cristina Pinotti, Vittorio Scarano: Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems. IPPS/SPDP 1998: 447-454 |
24 | EE | Gerth Stølting Brodal, Maria Cristina Pinotti: Comparator Networks for Binary Heap Construction. SWAT 1998: 158-168 |
23 | Sajal K. Das, Maria Cristina Pinotti: Distributed Data Access in Tree-Like Structures and Multidimensional Vector Spaces - A Survey. WDAS 1998: 21-42 | |
22 | Sajal K. Das, Maria Cristina Pinotti: O(log log N) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube. J. Parallel Distrib. Comput. 48(2): 200-211 (1998) | |
1997 | ||
21 | Sajal K. Das, Maria Cristina Pinotti: Conflict-Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems. COCOON 1997: 1-10 | |
20 | Gianfranco Bilardi, Bruno Codenotti, G. Del Corso, Maria Cristina Pinotti, Giovanni Resta: Broadcast and Associative Operations on Fat-Trees. Euro-Par 1997: 196-207 | |
19 | EE | Sajal K. Das, Maria Cristina Pinotti: O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers. IPPS 1997: 507-511 |
18 | EE | Maria Cristina Pinotti, Sajal K. Das, Falguni Sarkar: Conflict-Free Template Access in k-ary and Binomial Trees. International Conference on Supercomputing 1997: 237-244 |
17 | Sajal K. Das, Maria Cristina Pinotti: Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access. WADS 1997: 272-281 | |
1996 | ||
16 | Sajal K. Das, Maria Cristina Pinotti, Falguni Sarkar: Distributed Priority Queues on Hypercube Architectures. ICDCS 1996: 620-628 | |
15 | Vincenzo A. Crupi, Sajal K. Das, Maria Cristina Pinotti: Parallel and Distributed Meldable Priority Queues Based on Binomial Heaps. ICPP, Vol. 1 1996: 255-262 | |
14 | EE | Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das: A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking. IPPS 1996: 182-186 |
13 | EE | Sajal K. Das, Maria Cristina Pinotti, Falguni Sarkar: Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes. IEEE Trans. Parallel Distrib. Syst. 7(6): 555-564 (1996) |
12 | EE | Sajal K. Das, Maria Cristina Pinotti, Falguni Sarkar: Correction to "Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes". IEEE Trans. Parallel Distrib. Syst. 7(8): 896 (1996) |
1995 | ||
11 | Sajal K. Das, Falguni Sarkar, Maria Cristina Pinotti: Conflict-Free Path Access of Trees in Parallel Memory Systems with Application to Distributed Heap Implementation. ICPP (3) 1995: 164-167 | |
10 | EE | Ferruccio Barsi, Maria Cristina Pinotti: A Fully Parallel Algorithm for Residue to Binary Conversion. Inf. Process. Lett. 55(1): 25-26 (1995) |
9 | EE | Ferruccio Barsi, Maria Cristina Pinotti: Addendum to ``A Fully Parallel Algorithm for Residue to Binary Conversion''. Inf. Process. Lett. 56(2): 121 (1995) |
8 | EE | Maria Cristina Pinotti, Geppino Pucci: Parallel Algorithms for Priority Queue Operations. Theor. Comput. Sci. 148(1): 171-180 (1995) |
1994 | ||
7 | Ferruccio Barsi, Maria Cristina Pinotti: Time Optimal Mixed Radix Conversion for Residue Number Applications. Comput. J. 37(10): 907- (1994) | |
6 | Ferruccio Barsi, Maria Cristina Pinotti: A Fully Parallel Algorithm for Residue to Binary Conversion. Inf. Process. Lett. 50(1): 1-8 (1994) | |
1993 | ||
5 | Carlo Luchetti, Maria Cristina Pinotti: Some Comments on Building Heaps in Parallel. Inf. Process. Lett. 47(3): 145-148 (1993) | |
1992 | ||
4 | Maria Cristina Pinotti, Geppino Pucci: Parallel Algorithms for Priority Queue Operations. SWAT 1992: 130-139 | |
3 | Ferruccio Barsi, Maria Cristina Pinotti: Adding Flexibility to Hybrid Number Systems. Comput. J. 35(6): 630-635 (1992) | |
1991 | ||
2 | Maria Cristina Pinotti, Geppino Pucci: Parallel Priority Queues. Inf. Process. Lett. 40(1): 33-40 (1991) | |
1990 | ||
1 | EE | Fabrizio Luccio, Maria Cristina Pinotti: Suboptimal solution for PLA multiple column folding. Computer-Aided Design 22(8): 515-520 (1990) |