Остановите войну!
for scientists:
default search action
S. Venkatesan 0001
- > Home > Persons > S. Venkatesan 0001
Publications
- 2020
- [j26]Kenneth Platz, Neeraj Mittal, S. Venkatesan:
Practical concurrent unrolled linked lists using lazy synchronization. J. Parallel Distributed Comput. 139: 110-134 (2020) - 2019
- [c59]Kenneth Platz, Neeraj Mittal, S. Venkatesan:
Concurrent Unrolled Skiplist. ICDCS 2019: 1579-1589 - 2016
- [j25]Yanyan Zeng, K. Alex Mills, Shreyas Gokhale, Neeraj Mittal, S. Venkatesan, R. Chandrasekaran:
Robust neighbor discovery in multi-hop multi-channel heterogeneous wireless networks. J. Parallel Distributed Comput. 92: 15-34 (2016) - 2015
- [i1]Yanyan Zeng, K. Alex Mills, Shreyas Gokhale, Neeraj Mittal, S. Venkatesan, Ramaswamy Chandrasekaran:
Robust Neighbor Discovery in Multi-Hop Multi-Channel Heterogeneous Wireless Networks. CoRR abs/1505.00267 (2015) - 2014
- [c56]Kenneth Platz, Neeraj Mittal, Subbarayan Venkatesan:
Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization. OPODIS 2014: 388-403 - 2013
- [j23]Sara Arbab Yazd, Subbarayan Venkatesan, Neeraj Mittal:
Boosting energy efficiency with mirrored data block replication policy and energy scheduler. ACM SIGOPS Oper. Syst. Rev. 47(2): 33-40 (2013) - 2012
- [c53]Sara Arbab Yazd, Subbarayan Venkatesan, Neeraj Mittal:
Energy Efficient Hadoop Using Mirrored Data Block Replication Policy. SRDS 2012: 457-462 - 2011
- [c51]Chanaka Liyana Arachchige, S. Venkatesan, R. Chandrasekaran, Neeraj Mittal:
Minimal Time Broadcasting in Cognitive Radio Networks. ICDCN 2011: 364-375 - [c50]Neeraj Mittal, Yanyan Zeng, S. Venkatesan, R. Chandrasekaran:
Randomized Distributed Algorithms for Neighbor Discovery in Multi-hop Multi-channel Heterogeneous Wireless Networks. ICDCS 2011: 57-66 - [c49]Matthew Holiday, Neeraj Mittal, Subbarayan Venkatesan:
Secure Location Verification with Randomly-Selected Base Stations. ICDCS Workshops 2011: 119-122 - [c48]Ehsan Nourbakhsh, T. Ryan Burchfield, S. Venkatesan, Neeraj Mittal, Ravi Prakash:
Enhancing ASSERT: making an accurate testbed friendly. WiNTECH@MOBICOM 2011: 3-10 - 2010
- [c45]Yanyan Zeng, Neeraj Mittal, S. Venkatesan, R. Chandrasekaran:
Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks. ISPDC 2010: 149-156 - [c44]Ehsan Nourbakhsh, Jeff Dix, Paul Johnson, T. Ryan Burchfield, S. Venkatesan, Neeraj Mittal, Ravi Prakash:
ASSERT: A Wireless Networking Testbed. TRIDENTCOM 2010: 209-218 - 2009
- [j22]Neeraj Mittal, Srinivasan Krishnamurthy, R. Chandrasekaran, Subbarayan Venkatesan, Yanyan Zeng:
On neighbor discovery in cognitive radio networks. J. Parallel Distributed Comput. 69(7): 623-637 (2009) - [c42]Paul Johnson, Ehsan Nourbakhsh, T. Ryan Burchfield, Jeff Dix, Ravi Prakash, Subbarayan Venkatesan, Neeraj Mittal:
ASSERT: Advanced wireleSS Environment Research Testbed. SenSys 2009: 297-298 - [c41]Hai Trong Vu, Thuc D. Nguyen, Neeraj Mittal, S. Venkatesan:
PEQ: A Privacy-Preserving Scheme for Exact Query Evaluation in Distributed Sensor Data Networks. SRDS 2009: 189-198 - 2008
- [j21]Srinivasan Krishnamurthy, Mansi Ramakrishnan Thoppian, Srikant Kuppa, Ramaswamy Chandrasekaran, Neeraj Mittal, Subbarayan Venkatesan, Ravi Prakash:
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks. Comput. Networks 52(4): 831-849 (2008) - [j20]Neeraj Mittal, Felix C. Freiling, Subbarayan Venkatesan, Lucia Draque Penso:
On termination detection in crash-prone distributed systems with failure detectors. J. Parallel Distributed Comput. 68(6): 855-875 (2008) - [c39]Tarun Bansal, Neeraj Mittal, Subbarayan Venkatesan:
Leader Election Algorithms for Multi-channel Wireless Networks. WASA 2008: 310-321 - 2007
- [j18]Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri:
A family of optimal termination detection algorithms. Distributed Comput. 20(2): 141-162 (2007) - [c35]Hai Trong Vu, Neeraj Mittal, Subbarayan Venkatesan:
THIS: THreshold security for Information aggregation in Sensor networks. ITNG 2007: 89-95 - 2006
- [c29]Srinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal, Subbarayan Venkatesan:
Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks. DISC 2006: 572-574 - 2005
- [c22]Srinivasan Krishnamurthy, Mansi Ramakrishnan Thoppian, Srikant Kuppa, Subbarayan Venkatesan, Ramaswamy Chandrasekaran, Neeraj Mittal, Ravi Prakash:
Time-Efficient Layer-2 Auto-Configuration for Cognitive Radios. IASTED PDCS 2005: 459-464 - [c21]Subbarayan Venkatesan, Maulin Patel, Neeraj Mittal:
A Distributed Algorithm for Path Restoration in Circuit Switched Communication Networks. SRDS 2005: 226-236 - [c20]Neeraj Mittal, Felix C. Freiling, Subbarayan Venkatesan, Lucia Draque Penso:
Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System. DISC 2005: 93-107 - 2004
- [c16]Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri:
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies. DISC 2004: 290-304
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-05-08 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint