default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRohit Negi
- > Home > Persons > Rohit Negi
Publications
- 2013
[j17]Qiao Li, Tao Cui, Yang Weng, Rohit Negi, Franz Franchetti, Marija D. Ilic:
An Information-Theoretic Approach to PMU Placement in Electric Power Systems. IEEE Trans. Smart Grid 4(1): 446-456 (2013)- [c53]Yang Weng, Qiao Li, Rohit Negi, Marija D. Ilic:
Distributed algorithm for SDP state estimation. ISGT 2013: 1-6 - 2012
- [j16]Qiao Li, Rohit Negi:
Maximal Scheduling in Wireless Ad Hoc Networks With Hypergraph Interference Models. IEEE Trans. Veh. Technol. 61(1): 297-310 (2012) - [j15]Qiao Li, Rohit Negi:
Maximal Scheduling in Wireless Networks with Priorities. IEEE Trans. Wirel. Commun. 11(10): 3704-3713 (2012) - [c50]Andrew Cheng, Qiao Li, Rohit Negi:
Towards a secure fair MAC in wireless ad hoc networks using trusted computing technology. GLOBECOM 2012: 1023-1028 - [i10]Qiao Li, Tao Cui, Yang Weng, Rohit Negi, Franz Franchetti, Marija D. Ilic:
An Information-Theoretic Approach to PMU Placement in Electric Power Systems. CoRR abs/1201.2934 (2012) - 2011
- [c46]Qiao Li, Rohit Negi:
Distributed scheduling in cyber-physical systems: The case of coordinated Electric Vehicle charging. GLOBECOM Workshops 2011: 1183-1187 - [c45]Qiao Li, Rohit Negi:
Distributed Throughput-Optimal Scheduling in Ad Hoc Wireless Networks. ICC 2011: 1-5 - [c44]Qiao Li, Rohit Negi:
Scheduling in Wireless Networks under Uncertainties: A Greedy Primal-Dual Approach. ICC 2011: 1-5 - [i9]Qiao Li, Rohit Negi:
Distributed Throughput-optimal Scheduling in Ad Hoc Wireless Networks. CoRR abs/1102.1466 (2011) - [i8]Qiao Li, Tao Cui, Rohit Negi, Franz Franchetti, Marija D. Ilic:
On-line Decentralized Charging of Plug-In Electric Vehicles in Power Systems. CoRR abs/1106.5063 (2011) - [i7]Qiao Li, Rohit Negi:
Maximal Scheduling in Wireless Networks with Priorities. CoRR abs/1112.0539 (2011) - 2010
- [c43]Qiao Li, Rohit Negi:
Greedy Maximal Scheduling in Wireless Networks. GLOBECOM 2010: 1-5 - [c41]Qiao Li, Rohit Negi:
Scheduling in Wireless Networks under Uncertainties. ICC 2010: 1-5 - [i6]Qiao Li, Rohit Negi:
Optimal Scheduling in Wireless Networks: Towards a General Framework. CoRR abs/1001.2050 (2010) - [i5]Qiao Li, Rohit Negi:
Greedy Maximal Scheduling in Wireless Networks. CoRR abs/1007.4840 (2010) - 2009
- [c38]Qiao Li, Rohit Negi:
Back-Pressure Routing and Optimal Scheduling in Wireless Broadcast Networks. GLOBECOM 2009: 1-6 - [c36]Qiao Li, Rohit Negi:
Scheduling in Multi-Hop Wireless Networks with Priorities. INFOCOM 2009: 2926-2930 - [i3]Qiao Li, Rohit Negi:
Scheduling in Multi-hop Wireless Networks with Priorities. CoRR abs/0901.2922 (2009) - 2008
- [c34]Qiao Li, Rohit Negi:
Prioritized Maximal Scheduling in Wireless Networks. GLOBECOM 2008: 5187-5191 - [c32]Gyouhwan Kim, Qiao Li, Rohit Negi:
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks. ICC 2008: 3775-3779 - [c31]Qiao Li, Gyouhwan Kim, Rohit Negi:
Maximal Scheduling in a Hypergraph Model for Wireless Networks. ICC 2008: 3853-3857 - 2007
- [c28]Gyouhwan Kim, Qiao Li, Rohit Negi:
A Graph-Based Algorithm for Scheduling with Sum-Interference in Wireless Networks. GLOBECOM 2007: 5059-5063
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-25 05:58 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:
