The following pages link to Calvin Newport (Q661052):
Displayed 47 items.
- Modeling radio networks (Q661053) (← links)
- The abstract MAC layer (Q661062) (← links)
- Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks (Q1004318) (← links)
- How to discreetly spread a rumor in a crowd (Q1660945) (← links)
- The computational power of beeps (Q1664124) (← links)
- Contention resolution on a fading channel (Q2010610) (← links)
- On simple back-off in unreliable radio networks (Q2285148) (← links)
- Consensus and collision detectors in radio networks (Q2377252) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- Searching without communicating: tradeoffs between performance and selection complexity (Q2401119) (← links)
- Who are you? Secure identities in single hop ad hoc networks (Q2407629) (← links)
- A (Truly) Local Broadcast Layer for Unreliable Radio Networks (Q2796248) (← links)
- Efficient Communication in Cognitive Radio Networks (Q2796249) (← links)
- Broadcast in the Ad Hoc SINR Model (Q2920966) (← links)
- Aggregation in dynamic networks (Q2933795) (← links)
- Leader election in shared spectrum radio networks (Q2933797) (← links)
- Secure communication over radio channels (Q2934337) (← links)
- Multi-message broadcast with abstract MAC layers and unreliable links (Q2943610) (← links)
- Consensus with an abstract MAC layer (Q2943611) (← links)
- Trade-offs between selection complexity and performance when searching the plane without communication (Q2943625) (← links)
- Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast (Q3095331) (← links)
- Modeling Radio Networks (Q3184694) (← links)
- Gossiping in a Multi-channel Radio Network (Q3523209) (← links)
- The Abstract MAC Layer (Q3646216) (← links)
- Leader Election in Unreliable Radio Networks. (Q4598281) (← links)
- Bounds on Contention Management in Radio Networks (Q4909414) (← links)
- Efficient Symmetry Breaking in Multi-Channel Radio Networks (Q4909415) (← links)
- Approximate Neighbor Counting in Radio Networks (Q5091104) (← links)
- (Q5091105) (← links)
- Distributed Minimum Degree Spanning Trees (Q5145263) (← links)
- The wireless synchronization problem (Q5170316) (← links)
- Maximal independent sets in multichannel radio networks (Q5176112) (← links)
- The cost of radio network broadcast for different models of unreliable links (Q5176113) (← links)
- Broadcasting in unreliable radio networks (Q5176210) (← links)
- Consensus and collision detectors in wireless Ad Hoc networks (Q5177242) (← links)
- Contention Resolution on a Fading Channel (Q5361930) (← links)
- Contention Resolution on Multiple Channels with Collision Detection (Q5361932) (← links)
- Bounds for Blind Rate Adaptation (Q5363799) (← links)
- Gossip in a Smartphone Peer-to-Peer Network (Q5368939) (← links)
- Symmetry Breaking with Noisy Processes (Q5368976) (← links)
- On the weakest failure detector ever (Q5401416) (← links)
- Radio Network Lower Bounds Made Easy (Q5498700) (← links)
- Lower Bounds for Structuring Unreliable Radio Networks (Q5498701) (← links)
- Structuring unreliable radio networks (Q5892121) (← links)
- Smoothed analysis of dynamic networks (Q5915695) (← links)
- Structuring unreliable radio networks (Q5919151) (← links)
- Contention Resolution with Predictions (Q6201939) (← links)