- Incremental Maintenance of Aggregate and Outerjoin Expressions
- Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Member, IEEE, Himanshu Gupta, Member, IEEE, and Samir R. Das, Member, IEEE
- Communication-Efficient Implementation of Range-Joins in Sensor Networks
- Slotted Scheduled Tag Access in Multi-Reader RFID Systems Zongheng Zhou
- Deductive Framework for Programming Sensor Himanshu Gupta, Xianjin Zhu, Xiang Xu
- Connected K-Coverage Problem in Sensor Networks Zongheng Zhou, Samir Das, Himanshu Gupta
- Multichannel MAC Protocols for Wireless Networks Ritesh Maheshwari, Himanshu Gupta and Samir R. Das
- Fault Tolerant Connected Sensor Cover with Variable Sensing and Transmission Ranges
- Data Caching under Number Constraint Himanshu Gupta and Bin Tang
- Near-Optimal Dynamic Spectrum Allocation in Cellular Networks
- Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks
- Truthful Spectrum Auctions With Approximate Revenue Mahmoud Al-Ayyoub and Himanshu Gupta. Stony Brook University, NY
- Constructing Pairwise Disjoint Paths with Few Himanshu Gupta
- Cache Placement in Sensor Networks Under Update Cost Bin Tang and Himanshu Gupta
- Placement and Orientation of Rotating Directional Sensors
- Communication-Efficient Implementation of Join in Sensor Networks
- Slotted Scheduled Tag Access in Multi-Reader RFID Systems Zongheng Zhou
- Selection and Orientation of Directional Sensors for Coverage Maximization
- Variable Radii Connected Sensor Cover in Sensor Networks Zongheng Zhou, Samir Das, Himanshu Gupta
- Deductive Approach for Programming Sensor Networks Himanshu Gupta and Xianjin Zhu; Stony Brook University,NY
- Minimum-Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta, and Samir R. Das; SUNY, Stony Brook, NY.
- A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks
- Join of Multiple Data Streams in Sensor Networks Xianjin Zhu Himanshu Gupta Bin Tang
- Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution1
- CSE 305 Midterm (80 points) March: 3:50-5:10pm
- -Net Approach to Sensor k-Coverage Giordano Fusco and Himanshu Gupta
- This article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the
- Communication-Efficient Implementation of Join in Sensor Networks
- Communication-Efficient Implementation of Range-Joins in Sensor Networks
- Data Preservation Under Spatial Failures in Sensor Networks
- Distributed Protocols for Scheduling and Rate Control to Achieve Max-Min Fairness in Wireless Mesh Networks
- Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta, Samir Das
- Data Caching in Networks with Reading, Writing and Storage Costs
- Cache Placement in Sensor Networks Under Update Cost Constraint
- Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution
- Communication Efficient Matrix Multiplication on Hypercubes Himanshu Gupta P. Sadayappan
- Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
- Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking
- Variable Radii Connected Sensor Cover in Sensor ZONGHENG ZHOU, SAMIR R. DAS, HIMANSHU GUPTA
- Fault-Tolerant Manycast to Mobile Destinations in Sensor Networks Xianjin Zhu, Himanshu Gupta
- Efficient Gathering of Correlated Data in Sensor Networks
- CSE/MAT 373 Himanshu Gupta
- Greedy Approximation Proofs for Maximum Coverage and Set Cover Problems
- CSE 373 Midterm (100 points) April: 3:50-5:10pm
- CSE 373 Midterm (100 points) November: 5:20pm-6:40pm
- Greedy for Dominating Set November 30, 2011
- for all n>=1 -n+1) for all n>=4
