ICDCN 2011: Bangalore, India

• Hagit Attiya:
  Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It. 1-11
  
• Chandrakant D. Patel:
  Sustainable Ecosystems: Enabled by Supply and Demand Management. 12-28
  
• Jon Crowcroft, Anil Madhavapeddy, Malte Schwarzkopf, Theodore Hong, Richard Mortier:
  Unclouded Vision. 29-40
  
• Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
  Generating Fast Indulgent Algorithms. 41-52
  
• Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal:
  An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem. 53-64
  
• Roy Friedman, Alex Kogan:
  Deterministic Dominating Set Construction in Networks with Bounded Degree. 65-76
  
• Dirk Bradler, Lachezar Krumov, Max Mühlhäuser, Jussi Kangasharju:
  PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks. 77-82
  
• Hagit Attiya, Eshcar Hillel:
  Single-Version STMs Can Be Multi-version Permissive (Extended Abstract). 83-94
  
• Sathya Peri, Krishnamurthy Vidyasankar:
  Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems. 95-106
  
• Anastasia Braginsky, Erez Petrank:
  Locality-Conscious Lock-Free Linked Lists. 107-118
  
• Vibhor Bhatt, Prasad Jayanti:
  Specification and Constant RMR Algorithm for Phase-Fair Reader-Writer Lock. 119-130
  
• Yuval Lubowich, Gadi Taubenfeld:
  On the Performance of Distributed Lock-Based Synchronization. 131-142
  
• Shivali Agarwal, Saurabh Joshi, Rudrapatna K. Shyamasundar:
  Distributed Generalized Dynamic Barrier Synchronization. 143-154
  
• Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, Henri E. Bal:
  A High-Level Framework for Distributed Processing of Large-Scale Graphs. 155-166
  
• Ankur Narang, Abhinav Srivastava, Naga Praveen Kumar Katta, Rudrapatna K. Shyamasundar:
  Affinity Driven Distributed Scheduling Algorithm for Parallel Computations. 167-178
  
• Shamimuddin Sheerazuddin:
  Temporal Specifications for Services with Unboundedly Many Passive Clients. 179-190
  
• Eli Gafni, Petr Kuznetsov:
  Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets. 191-202
  
• Valerie King, Steven Lonargan, Jared Saia, Amitabh Trehan:
  Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information. 203-214
  
• Olivier Baldellon, Achour Mostéfaoui, Michel Raynal:
  A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks. 215-226
  
• Anwitaman Datta, Rajesh Sharma:
  GoDisco: Selective Gossip Based Dissemination of Information in Social Community Based Overlays. 227-238
  
• Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar Patil, Ankit Mehrotra:
  Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres. 239-250
  
• Hrishikesh B. Acharya, Mohamed G. Gouda:
  On the Hardness of Topology Inference. 251-262
  
• Sukanta Bhattacharya, Tanmay De, Ajit Pal:
  An Algorithm for Traffic Grooming in WDM Mesh Networks Using Dynamic Path Selection Strategy. 263-268
  
• Bala Kalyanasundaram, Mahe Velauthapillai:
  Analysis of a Simple Randomized Protocol to Establish Communication in Bounded Degree Sensor Networks. 269-280
  
• Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, Jennifer L. Welch:
  Reliable Networks with Unreliable Sensors. 281-292
  
• Ataul Bari, Arunita Jaekel, Subir Bandyopadhyay:
  Energy Aware Fault Tolerant Routing in Two-Tiered Sensor Networks. 293-302
  
• Congduc Pham:
  Scheduling Randomly-Deployed Heterogeneous Video Sensor Nodes for Reduced Intrusion Detection Time. 303-314
  
• Nicholas Martin, Yamin Al-Mousa, Nirmala Shenoy:
  An Integrated Routing and Medium Access Control Framework for Surveillance Networks of Mobile Devices. 315-327
  
• George C. Hadjichristofi, Christoforos N. Hadjicostis, Dipankar Raychaudhuri:
  Security in the Cache and Forward Architecture for the Next Generation Internet. 328-339
  
• Prasant Misra, Nadeem Ahmed, Diethelm Ostry, Sanjay Jha:
  Characterization of Asymmetry in Low-Power Wireless Links: An Empirical Study. 340-351
  
• Anthony Plummer Jr., Mahmoud Taghizadeh, Subir Biswas:
  Model Based Bandwidth Scavenging for Device Coexistence in Wireless LANs. 352-363
  
• Chanaka Liyana Arachchige, S. Venkatesan, R. Chandrasekaran, Neeraj Mittal:
  Minimal Time Broadcasting in Cognitive Radio Networks. 364-375
  
• Rayman Preet Singh, Arobinda Gupta:
  Traffic Congestion Estimation in VANETs and Its Application to Information Dissemination. 376-381
  
• Yoshihiro Nozaki, Hasan Tuncer, Nirmala Shenoy:
  A Tiered Addressing Scheme Based on a Floating Cloud Internetworking Model. 382-393
  
• Saugat Majumdar, Dhananjay Kulkarni, Chinya V. Ravishankar:
  DHCP Origin Traceback. 394-406
  
• Veeramani Mahendran, Sivaraman K. Anirudh, C. Siva Ram Murthy:
  A Realistic Framework for Delay-Tolerant Network Routing in Open Terrains with Continuous Churn. 407-417
  

Last update Fri May 25 08:17:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page