default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 95 matches
- 2010
- Esther M. Arkin, Valentin Polishchuk, Alon Efrat, Srinivasan Ramasubramanian, Javad Taheri, Joseph S. B. Mitchell, Swaminathan Sankararaman:
Data transmission and base-station placement for optimizing network lifetime. DIALM-PODC 2010: 23-32 - Chen Avin, Yuval Lando, Zvi Lotker:
Radio cover time in hyper-graphs. DIALM-PODC 2010: 3-12 - Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz:
Bandwidth allocation in cellular networks with multiple interferences. DIALM-PODC 2010: 33-42 - Ohad Ben-Shahar, Shlomi Dolev, Andrey Dolgin, Michael Segal:
Direction election in flocking swarms. DIALM-PODC 2010: 73-80 - Ranveer Chandra:
Networking devices over TV white spaces. DIALM-PODC 2010: 2 - Hyun Chul Chung, Peter Robinson, Jennifer L. Welch:
Regional consecutive leader election in mobile ad-hoc networks. DIALM-PODC 2010: 81-90 - Alejandro Cornejo, Calvin C. Newport:
Prioritized gossip in vehicular networks. DIALM-PODC 2010: 53-62 - Alejandro Cornejo, Saira Viqar, Jennifer L. Welch:
Reliable neighbor discovery for mobile ad hoc networks. DIALM-PODC 2010: 63-72 - Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, Giuseppe Persiano, Paul G. Spirakis:
Information security for sensors by overwhelming random sequences and permutations. DIALM-PODC 2010: 43-48 - Majid Khabbazian, Fabian Kuhn, Dariusz R. Kowalski, Nancy A. Lynch:
Decomposing broadcast algorithms using abstract MAC layers. DIALM-PODC 2010: 13-22 - Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Finding available parking spaces made easy. DIALM-PODC 2010: 49-52 - Rajmohan Rajaraman:
Games ad hoc networks play. DIALM-PODC 2010: 1 - Andréa W. Richa, Thomas Moscibroda:
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Cambridge, Massachusetts, USA, September 16, 2010. ACM 2010, ISBN 978-1-4503-0413-9 [contents] - 2008
- Chen Avin:
Distance graphs: from random geometric graphs to Bernoulli graphs and between. DIALM-POMC 2008: 71-78 - Prithwish Basu, Chi-Kin Chau:
Latency of opportunistic forwarding in finite regular wireless networks. DIALM-POMC 2008: 55-64 - Gruia Calinescu, Robert B. Ellis:
Monitoring schedules for randomly deployed sensor networks. DIALM-POMC 2008: 3-12 - Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Gossiping (via mobile?) in social networks. DIALM-POMC 2008: 27-28 - Shlomi Dolev:
Self-stabilizing and self-orgenizing mobile networks. DIALM-POMC 2008: 25-26 - Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan:
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. DIALM-POMC 2008: 79-86 - Olga Goussevskaia, Thomas Moscibroda, Roger Wattenhofer:
Local broadcasting in the physical interference model. DIALM-POMC 2008: 35-44 - Qiang-Sheng Hua, Francis C. M. Lau:
Exact and approximate link scheduling algorithms under the physical interference model. DIALM-POMC 2008: 45-54 - Jamie Macbeth, Majid Sarrafzadeh:
Scalable medium access control for in-network data aggregation. DIALM-POMC 2008: 13-22 - Tim Nieberg:
Local, distributed weighted matching on general and wireless topologies. DIALM-POMC 2008: 87-92 - Zeev Nutov:
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows. DIALM-POMC 2008: 29-34 - Andrzej Pelc:
Algorithmic aspects of radio communication. DIALM-POMC 2008: 1-2 - Eric Schmutz:
Symmetric range assignment with disjoint MST constraints. DIALM-POMC 2008: 65-70 - Roger Wattenhofer:
Theory for sensor networks: what is it good for? DIALM-POMC 2008: 23-24 - Michael Segal, Alexander Kesselman:
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Toronto, Canada, August 18-21, 2008. ACM 2008, ISBN 978-1-60558-244-3 [contents] - 2007
- Vartika Bhandari, Nitin H. Vaidya:
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures. DIALM-POMC 2007 - Yu Chen, Eric Fleury:
Backbone-based Scheduling for Data Dissemination in Wireless Sensor Networks with Mobile Sinks. DIALM-POMC 2007
skipping 65 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-12-19 10:47 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint