![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Harish Sethu
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j20]Guyue Han
, Harish Sethu
:
Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs. IEEE Trans. Big Data 6(1): 29-42 (2020)
2010 – 2019
- 2019
- [j19]Tingshan Huang, Nagarajan Kandasamy
, Harish Sethu
, Matthew C. Stamm
:
An Efficient Strategy for Online Performance Monitoring of Datacenters via Adaptive Sampling. IEEE Trans. Cloud Comput. 7(1): 155-169 (2019) - 2018
- [i10]Guyue Han, Harish Sethu:
Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs. CoRR abs/1805.07448 (2018) - 2017
- [c33]Guyue Han, Harish Sethu:
Edge Sample and Discard: A New Algorithm for Counting Triangles in Large Dynamic Graphs. ASONAM 2017: 44-49 - [c32]Guyue Han, Harish Sethu:
Closed walk sampler: An efficient method for estimating the spectral radius of large graphs. IEEE BigData 2017: 616-625 - [i9]Guyue Han, Harish Sethu:
Edge Sample and Discard: A New Algorithm for Counting Triangles in Large Dynamic Graphs. CoRR abs/1706.04660 (2017) - 2016
- [j18]Tingshan Huang, Harish Sethu
, Nagarajan Kandasamy:
A New Approach to Dimensionality Reduction for Anomaly Detection in Data Traffic. IEEE Trans. Netw. Serv. Manag. 13(3): 651-665 (2016) - [c31]Guyue Han, Harish Sethu:
Waddling Random Walk: Fast and Accurate Mining of Motif Statistics in Large Graphs. ICDM 2016: 181-190 - [i8]Guyue Han, Harish Sethu:
Waddling Random Walk: Fast and Accurate Sampling of Motif Statistics in Large Graphs. CoRR abs/1605.09776 (2016) - [i7]Tingshan Huang, Harish Sethu, Nagarajan Kandasamy:
A New Approach to Dimensionality Reduction for Anomaly Detection in Data Traffic. CoRR abs/1606.04552 (2016) - 2015
- [j17]Xiaoyu Chu, Harish Sethu:
Cooperative Topology Control with Adaptation for improved lifetime in wireless sensor networks. Ad Hoc Networks 30: 99-114 (2015) - [c30]Tingshan Huang, Harish Sethu, Nagarajan Kandasamy:
A fast algorithm for detecting anomalous changes in network traffic. CNSM 2015: 251-255 - [c29]Xiaoyu Chu, Harish Sethu:
On estimating the Spectral Radius of large graphs through subgraph sampling. INFOCOM Workshops 2015: 432-437 - [c28]Tingshan Huang, Nagarajan Kandasamy, Harish Sethu:
Anomaly detection in computer systems using compressed measurements. ISSRE 2015: 1-11 - 2014
- [c27]Justin Hummel, Andrew McDonald, Vatsal Shah, Riju Singh, Bradford D. Boyle, Tingshan Huang, Nagarajan Kandasamy, Harish Sethu, Steven Weber:
A modular multi-location anonymized traffic monitoring tool for a WiFi network. CODASPY 2014: 135-138 - [c26]Xiaoyu Chu, Harish Sethu:
An Energy Balanced dynamic Topology Control algorithm for improved network lifetime. WiMob 2014: 556-561 - 2013
- [i6]Xiaoyu Chu, Harish Sethu:
Cooperative Topology Control with Adaptation for Improved Lifetime in Wireless Sensor Networks. CoRR abs/1309.3260 (2013) - [i5]Xiaoyu Chu, Harish Sethu:
An Energy Balanced Dynamic Topology Control Algorithm for Improved Network Lifetime. CoRR abs/1309.3284 (2013) - 2012
- [j16]Xiaoyu Chu, Harish Sethu:
On improving the representation of a region achieved by a sensor network. Ad Hoc Networks 10(3): 552-568 (2012) - [c25]Tingshan Huang, Nagarajan Kandasamy, Harish Sethu:
Evaluating compressive sampling strategies for performance monitoring of data centers. ICAC 2012: 201-210 - [c24]Xiaoyu Chu, Harish Sethu:
Cooperative topology control with adaptation for improved lifetime in wireless ad hoc networks. INFOCOM 2012: 262-270 - [c23]Tingshan Huang, Nagarajan Kandasamy, Harish Sethu:
Evaluating compressive sampling strategies for performance monitoring of data centers. NOMS 2012: 655-658 - [i4]Harish Sethu, Xiaoyu Chu:
A new algorithm for extracting a small representative subgraph from a very large graph. CoRR abs/1207.4825 (2012) - 2011
- [c22]Xiaoyu Chu, Harish Sethu:
A New Power-Aware Distributed Topology Control Algorithm for Wireless Ad Hoc Networks. GLOBECOM 2011: 1-5 - [c21]Xiaoyu Chu, Harish Sethu:
The energy cost of mandatory bidirectionality in wireless multimedia communication. GLOBECOM Workshops 2011: 755-760 - 2010
- [j15]Harish Sethu, Thomas Gerety:
A new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation. Ad Hoc Networks 8(3): 280-294 (2010) - [c20]Harish Sethu, Alexander Yates:
Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph. SocialCom/PASSAT 2010: 683-686
2000 – 2009
- 2009
- [c19]Xiaoyu Chu, Harish Sethu:
A New Distributed Algorithm for Even Coverage and Improved Lifetime in a Sensor Network. INFOCOM 2009: 361-369 - [i3]Xiaoyu Chu, Harish Sethu:
A New Distributed Algorithm for Improved Coverage and Increased Lifetime in Sensor Networks. CoRR abs/0911.1379 (2009) - 2008
- [j14]Madhusudan Hosaagrahara, Harish Sethu:
Max-Min Fair Scheduling in Input-Queued Switches. IEEE Trans. Parallel Distributed Syst. 19(4): 462-475 (2008) - 2007
- [j13]Madhusudan Hosaagrahara, Harish Sethu:
Degree-sequenced matching algorithms for input-queued switches. Telecommun. Syst. 34(1-2): 37-49 (2007) - [c18]Harish Sethu, Thomas Gerety:
A Distributed Topology Control Algorithm in the Presence of Multipath Propagation. MobiQuitous 2007: 1-8 - [i2]Harish Sethu, Thomas Gerety:
A Distributed Topology Control Algorithm in the Presence of Multipath Propagation. CoRR abs/0709.0961 (2007) - [i1]Harish Sethu:
The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks. CoRR abs/0709.0965 (2007) - 2006
- [j12]Yunkai Zhou, Harish Sethu:
On achieving fairness in the joint allocation of buffer and bandwidth resources: Principles and algorithms. Comput. Networks 50(13): 2239-2254 (2006) - 2005
- [j11]Hongyuan Shi, Harish Sethu, Salil S. Kanhere
:
An evaluation of fair packet schedulers using a novel measure of instantaneous fairness. Comput. Commun. 28(17): 1925-1937 (2005) - [j10]Yunkai Zhou, Harish Sethu:
Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources in switches and routers. Comput. Commun. 28(18): 2105-2118 (2005) - [j9]Yunkai Zhou, Harish Sethu:
On achieving fairness in the joint allocation of processing and bandwidth resources: principles and algorithms. IEEE/ACM Trans. Netw. 13(5): 1054-1067 (2005) - [j8]Jie Yu, Athina P. Petropulu, Harish Sethu:
Rate-limited EAFRP - a new improved model for high-speed network traffic. IEEE Trans. Signal Process. 53(2-1): 505-522 (2005) - [c17]Madhusudan Hosaagrahara, Harish Sethu:
A new low-delay matching algorithm for input-queued switches. ICCCN 2005: 457-462 - [c16]Adam J. O'Donnell, Harish Sethu:
Software Diversity as a Defense against Viral Propagation: Models and Simulations. PADS 2005: 247-253 - [c15]Harpreet Arora, Lloyd G. Greenwald, Harish Sethu, John Novatnack:
Synchronization effects in mobile ad hoc networks. WiMob (3) 2005: 32-40 - 2004
- [j7]Salil S. Kanhere
, Harish Sethu:
On the latency and fairness characteristics of pre-order deficit round Robin. Comput. Commun. 27(7): 664-678 (2004) - [c14]Adam J. O'Donnell, Harish Sethu:
On achieving software diversity for improved network security using distributed coloring algorithms. CCS 2004: 121-131 - 2003
- [j6]Adam J. O'Donnell, Harish Sethu:
Congestion control, differentiated services, and efficient capacity management through a novel pricing strategy. Comput. Commun. 26(13): 1457-1469 (2003) - [j5]Hongyuan Shi, Harish Sethu:
On scheduling real-time traffic under controlled load service in an integrated services Internet. J. Commun. Networks 5(1): 73-81 (2003) - [j4]Salil S. Kanhere
, Harish Sethu:
Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels. J. Parallel Distributed Comput. 63(12): 1288-1299 (2003) - [c13]Jie Yu, Athina P. Petropulu, Harish Sethu:
Rate-limited EAFRP: a new improved model for high-speed network traffic. ICASSP (6) 2003: 25-28 - [c12]Hongyuan Shi, Harish Sethu:
An evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness. IPCCC 2003: 443-450 - [c11]Yunkai Zhou, Harish Sethu:
Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources. IPCCC 2003: 495-504 - [c10]Yunkai Zhou, Harish Sethu:
On Achieving Fairness in the Joint Allocation of Processing and Bandwidth Resources. IWQoS 2003: 97-114 - [c9]Hongyuan Shi, Harish Sethu:
Greedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling. RTSS 2003: 345-356 - 2002
- [j3]Salil S. Kanhere
, Harish Sethu:
Low-latency guaranteed-rate scheduling using Elastic Round Robin. Comput. Commun. 25(14): 1315-1322 (2002) - [j2]Yunkai Zhou, Harish Sethu:
On the relationship between absolute and relative fairness bounds. IEEE Commun. Lett. 6(1): 37-39 (2002) - [j1]Salil S. Kanhere
, Harish Sethu, Alpa B. Parekh:
Fair and Efficient Packet Scheduling Using Elastic Round Robin. IEEE Trans. Parallel Distributed Syst. 13(3): 324-336 (2002) - [c8]Adam J. O'Donnell, Harish Sethu:
A novel, practical pricing strategy for congestion control and differentiated services. ICC 2002: 986-990 - [c7]Yunkai Zhou, Harish Sethu:
On the effectiveness of buffer sharing in multimedia server network switches with self-similar traffic. ICC 2002: 2533-2536 - [c6]Salil S. Kanhere
, Harish Sethu:
On the latency bound of deficit round robin. ICCCN 2002: 548-553 - [c5]Salil S. Kanhere
, Harish Sethu:
On the Latency Bound of Pre-Order Deficit Round Robin. LCN 2002: 508-517 - 2000
- [c4]Harish Sethu:
Congestion-Free Routing of Streaming Multimedia Content in BMIN-Based Parallel Systems. IPDPS Workshops 2000: 234-241 - [c3]Salil S. Kanhere, Alpa B. Parekh, Harish Sethu:
Fair and Efficient Packet Scheduling in Wormhole Networks. IPDPS 2000: 623-632
1990 – 1999
- 1998
- [c2]Harish Sethu, Craig B. Stunkel, Robert F. Stucke:
IBM RS/6000 SP Interconnection Network Topologies for Large Systems. ICPP 1998: 620- - 1992
- [c1]Harish Sethu, Meghanad D. Wagh:
Design of Time-Optimal Hardware-Efficient Divide-and-Conquer Algorithms. ICPP (3) 1992: 237-240
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23: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