default search action
Huzur Saran
Person information
- affiliation: ERNET, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c40]Sourav Bansal, Manav Bansal, Rohit Verma, Rajeev Shorey, Huzur Saran:
FedNSE: Optimal Node Selection for Federated Learning with Non-IID Data. COMSNETS 2023: 713-721 - [c39]Aniket Modi
, Rishi Shah, Krishnanshu Jain, Rohit Verma, Rajeev Shorey, Huzur Saran:
Multi-Agent Packet Routing (MAPR): Co-Operative Packet Routing Algorithm with Multi-Agent Reinforcement Learning. COMSNETS 2023: 722-730 - 2022
- [j15]Suraj Sajeev
Secure and ultra-reliable provenance recovery in sparse networks: Strategies and performance bounds. Ad Hoc Networks 131: 102860 (2022) - [c38]Manupriya Gupta, Pavas Goyal, Rohit Verma, Rajeev Shorey, Huzur Saran:
FedFM: Towards a Robust Federated Learning Approach For Fault Mitigation at the Edge Nodes. COMSNETS 2022: 362-370 - [i2]Suraj Sajeev, Manish Bansal, Sriraam S. V, Jagadeesh Harshan, Huzur Saran, Yih-Chun Hu:
Secure and Ultra-Reliable Provenance Recovery in Sparse Networks: Strategies and Performance Bounds. CoRR abs/2204.00159 (2022) - 2021
- [c37]Suresh C. Gupta, Pimmy Gandotra, Brejesh Lall, Huzur Saran, Krishan K. Sabnani:
Layered Architecture and Virtualization for 5G Slicing. 5GWF 2021: 153-158 - [c36]Arzad Alam Kherani, Gaurav Shukla, Shashvat Sanadhya, Neha Vasudev, Muneeb Ahmed, Ashish Singh Patel
Development of MEC system for indigenous 5G Test-Bed. COMSNETS 2021: 131-133 - [i1]Manupriya Gupta, Pavas Goyal, Rohit Verma, Rajeev Shorey, Huzur Saran:
FedFm: Towards a Robust Federated Learning Approach For Fault Mitigation at the Edge Nodes. CoRR abs/2111.01074 (2021) - 2020
- [c35]Suresh C. Gupta, Gaurav Gupta, Huzur Saran:
New Vision for 5G Backbone Network Architecture. 5G World Forum 2020: 330-336
2010 – 2019
- 2018
- [j14]Divyashikha Sethia, Huzur Saran, Daya Gupta:
CP-ABE for Selective Access with Scalable Revocation: A Case Study for Mobile-based Healthfolder. Int. J. Netw. Secur. 20(4): 689-701 (2018) - [j13]Divyashikha Sethia
NFC Secure Element-Based Mutual Authentication and Attestation for IoT Access. IEEE Trans. Consumer Electron. 64(4): 470-479 (2018) - 2017
- [j12]Swati Sharma
Towards repeatability & verifiability in networking experiments: A stochastic framework. J. Netw. Comput. Appl. 81: 12-23 (2017) - [c34]Divyashikha Sethia
Optimized MapFile based Storage of Small files in Hadoop. CCGrid 2017: 906-912 - 2016
- [c33]Divyashikha Sethia
Security framework for portable NFC mobile based health record system. WiMob 2016: 1-8 - 2014
- [c32]Divyashikha Sethia
NFC based secure mobile healthcare system. COMSNETS 2014: 1-6 - 2013
- [c31]Eshan Nanda, Udit Joshi, Vinay J. Ribeiro, Huzur Saran:
RODMAC: A RObust and Distributed MAC protocol for efficient use of white spaces. COMSNETS 2013: 1-10 - [c30]Sriram Raghavan, Huzur Saran:
UniTIME: Timestamp interpretation engine for developing unified timelines. SADFE 2013: 1-7 - 2012
- [c29]Aniesh Chawla, Vinay Yadav, Vasu Dev Sharma, Jitin Bajaj, Eshan Nanda, Vinay J. Ribeiro, Huzur Saran:
RODEO: Robust and rapidly deployable TDM mesh with QoS differentiation. COMSNETS 2012: 1-6 - 2011
- [c28]Swati Sharma
An Empirical study of clock skew behavior in modern mobile and hand-held devices. COMSNETS 2011: 1-4 - [c27]Abhishek Gupta, Jatin Kumar, Daniel J. Mathew, Sorav Bansal, Subhashis Banerjee, Huzur Saran:
Design and Implementation of the Workflow of an Academic Cloud. DNIS 2011: 16-25 - [c26]Pragun Goyal, Vinay J. Ribeiro, Huzur Saran, Anshul Kumar:
Strap-down Pedestrian Dead-Reckoning system. IPIN 2011: 1-7
2000 – 2009
- 2008
- [c25]Sanjam Garg
Anti-DDoS Virtualized Operating System. ARES 2008: 667-674 - 2006
- [c24]Pankaj Garg, Amit Kumar, Huzur Saran:
Enhanced distributed hash tables for complex queries. COMSWARE 2006: 1-9 - [c23]Divyashikha Sethia
Error Resilient Video Streaming for Heterogeneous Networks. HiPC 2006: 326-337 - 2005
- [c22]Parminder Chhabra, Ajita John, Huzur Saran:
PISA: Automatic Extraction of Traffic Signatures. NETWORKING 2005: 730-742 - 2004
- [j11]Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey
Fair adaptive bandwidth allocation: a rate control based active queue management discipline. Comput. Networks 44(2): 135-152 (2004) - [c21]Ankur Agiwal, Parakram Khandpur, Huzur Saran:
LOCATOR: location estimation system For wireless LANs. WMASH 2004: 102-109 - 2003
- [c20]Parminder Chhabra, Ajita John, Huzur Saran, Rajeev Shorey:
Controlling malicious sources at Internet gateways. ICC 2003: 1636-1640 - 2002
- [c19]Parminder Chhabra, Shobhit Chuig, Anurag Goel, Ajita John, Abhishek Kumar
XCHOKE: Malicious Source Control for Congestion Avoidance at Internet Gateways. ICNP 2002: 186-187 - [c18]Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey
Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline. NETWORKING 2002: 838-849 - 2001
- [c17]Abhay Chrungoo, Vishu Gupta, Huzur Saran, Rajeev Shorey:
TCP k-SACK: a simple protocol to improve performance over lossy links. GLOBECOM 2001: 1713-1717 - [c16]Shuchi Chawla, Huzur Saran, Mitali Singh:
QoS based scheduling for incorporating variable rate coded voice in Bluetooth. ICC 2001: 1232-1237 - [c15]Indraneel Chakraborty
MAC scheduling policies with reduced power consumption and bounded packet delays for centrally controlled TDD wireless networks. ICC 2001: 1980-1984 - [c14]Rajeev Shorey
Enhancing Performance of Asynchronous Data Traffic over the Bluetooth Wireless Ad-hoc Network. INFOCOM 2001: 591-600 - 2000
- [j10]P. P. Mishra, Huzur Saran:
Capacity management and routing policies for voice over IP traffic. IEEE Netw. 14(2): 20-27 (2000) - [c13]Rahul Garg, Huzur Saran:
Fair Bandwidth Sharing Among Virtual Networks: A Capacity Resizing Approach. INFOCOM 2000: 255-264
1990 – 1999
- 1999
- [j9]Naveen Garg
Finding Separator Cuts in Planar Graphs within Twice the Optimal. SIAM J. Comput. 29(1): 159-179 (1999) - [c12]Deepak Bansal, Manish Kalia, Huzur Saran:
MobiDAT: Mobile Data Access and Transactions. HiPC 1999: 246-250 - 1996
- [j8]Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan:
An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. IEEE Trans. Inf. Theory 42(6): 1839-1854 (1996) - [j7]Ritesh Ahuja, Srinivasan Keshav
Design, implementation, and performance measurement of a native-mode ATM transport layer (extended version). IEEE/ACM Trans. Netw. 4(4): 502-515 (1996) - [c11]Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan:
An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. FOCS 1996: 144-153 - [c10]Ritesh Ahuja, Srinivasan Keshav, Huzur Saran:
Design, Implementation, and Performance of a Native Mode ATM Transport Layer. INFOCOM 1996: 206-214 - 1995
- [j6]Srinivasan Keshav
An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks. IEEE J. Sel. Areas Commun. 13(8): 1371-1382 (1995) - [j5]Huzur Saran, Vijay V. Vazirani:
Finding k Cuts within Twice the Optimal. SIAM J. Comput. 24(1): 101-108 (1995) - 1994
- [j4]Huzur Saran, Srinivasan Keshav
A Scheduling Discipline and Admission Control Policy for Xunet 2. Multim. Syst. 2(3): 118-128 (1994) - [j3]H. Narayanan, Huzur Saran, Vijay V. Vazirani:
Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees. SIAM J. Comput. 23(2): 387-397 (1994) - [c9]Naveen Garg, Huzur Saran, Vijay V. Vazirani:
Finding separator cuts in planar graphs within twice the optimal. FOCS 1994: 14-23 - [c8]Vivek Arora, Santosh S. Vempala, Huzur Saran, Vijay V. Vazirani:
A Limited-Backtrack Greedy Schema for Approximation Algorithms. FSTTCS 1994: 318-329 - [c7]Huzur Saran, Srinivasan Keshav:
An Empirical Evaluation of Virtual Circuit Holding Times in IP-Over-ATM Networks. INFOCOM 1994: 1132-1140 - 1993
- [c6]Huzur Saran, Srinivasan Keshav, Charles R. Kalmanek, Stephen P. Morgan:
A Scheduling Discipline and Admission Control Policy for Xunet 2. NOSSDAV 1993: 89-101 - 1992
- [c5]H. Narayanan, Huzur Saran, Vijay V. Vazirani:
Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. SODA 1992: 357-366 - 1991
- [c4]Huzur Saran, Vijay V. Vazirani:
Finding k-cuts within Twice the Optimal. FOCS 1991: 743-751 - [c3]Arvind Raghunathan, Huzur Saran:
Is the Shuffle-Exchange Better Than the Butterfly? ISA 1991: 32-41 - 1990
- [j2]Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. J. Comput. Syst. Sci. 40(1): 19-48 (1990)
1980 – 1989
- 1989
- [j1]Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Perfect Graphs and Orthogonally Convex Covers. SIAM J. Discret. Math. 2(3): 371-392 (1989) - 1988
- [c2]Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. SCG 1988: 211-223 - [c1]Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Constructive Results from Graph Minors: Linkless Embeddings. FOCS 1988: 398-409
Coauthor Index
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-08-14 22:17 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: