• 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.

found 158 matches

• 2014
• 
  Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
  Universal routing in multi hop radio network. FOMC 2014: 19-28
• 
  Varsha Dani:
  Resource-competitive error correction. FOMC 2014: 53-58
• 
  Benjamin Grimmer, Kan Qiao:
  Near linear time 5/3-approximation algorithms for two-level power assignment problems. FOMC 2014: 29-38
• 
  Yunhua He, Limin Sun, Zhi Li, Hong Li, Xiuzhen Cheng:
  An optimal privacy-preserving mechanism for crowdsourced traffic monitoring. FOMC 2014: 11-18
• 
  Dariusz R. Kowalski, Miguel A. Mosteiro, Tevin Rouse:
  Dynamic multiple-message broadcast: bounding throughput in the affectance model. FOMC 2014: 39-46
• 
  Matthieu Roy, Stefan Schmid, Gilles Trédan:
  Modeling and measuring graph similarity: the case for centrality distance. FOMC 2014: 47-52
• 
  Mahdi Zamani, Mahnush Movahedi:
  Secure location sharing. FOMC 2014: 1-10
• 
  Jared Saia, Maxwell Young:
  10th ACM International Workshop on Foundations of Mobile Computing, FOMC 2014, Philadelphia, PA, USA, August 11, 2014. ACM 2014, ISBN 978-1-4503-2984-2 [contents]
• 2012
• 
  Yair Allouche, Michael Segal:
  VANET in eyes of hierarchical topology. FOMC 2012: 7
• 
  Chen Avin, Michael Borokhovich, Yoram Haddad, Zvi Lotker:
  Optimal virtual traffic light placement. FOMC 2012: 6
• 
  András Faragó:
  Network analysis under perturbations. FOMC 2012: 4
• 
  Seth Gilbert, Jared Saia, Valerie King, Maxwell Young:
  Resource-competitive analysis: a new perspective on attack-resistant distributed computing. FOMC 2012: 1
• 
  Magnús M. Halldórsson, Pradipta Mitra:
  Towards tight bounds for local broadcasting. FOMC 2012: 2
• 
  Andreas Loukas, Matthias Woehrle, Philipp M. Glatz, Koen Langendoen:
  On distributed computation of information potentials. FOMC 2012: 5
• 
  Nancy A. Lynch, Tsvetomira Radeva, Srikanth Sastry:
  Asynchronous leader election and MIS using abstract MAC layer. FOMC 2012: 3
• 
  Fabian Kuhn, Calvin C. Newport:
  FOMC'12, The Eighth ACM International Workshop on Foundations of Mobile Computing (part of PODC 2012), Funchal, Portugal, July 19, 2012, Proceedings. ACM 2012, ISBN 978-1-4503-1537-1 [contents]
• 2011
• 
  Jean Bolot:
  Mining and modeling large scale cell phone data: invited talk. FOMC 2011: 1-3
• 
  Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
  Passively mobile communicating machines that use restricted space. FOMC 2011: 6-15
• 
  Hyun Chul Chung, Peter Robinson, Jennifer L. Welch:
  Optimal regional consecutive leader election in mobile ad-hoc networks. FOMC 2011: 52-61
• 
  Mirela Damian, Abhaykumar Kumbhar:
  Undirected connectivity of sparse Yao graphs. FOMC 2011: 25-32
• 
  Seth Gilbert:
  Faster and better the promise of dynamic spectrum access: invited talk. FOMC 2011: 5
• 
  Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer:
  Time-optimal information exchange on multiple channels. FOMC 2011: 69-76
• 
  Sachin Katti:
  Wireless network coding: invited talk. FOMC 2011: 4
• 
  Majid Khabbazian, Fabian Kuhn, Nancy A. Lynch, Muriel Médard, Ali ParandehGheibi:
  MAC design for analog network coding. FOMC 2011: 42-51
• 
  Liron Levin, Michael Segal, Hanan Shpungin:
  Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks. FOMC 2011: 62-69
• 
  A. Prasad Sistla, Ouri Wolfson, Bo Xu, Naphtali Rishe:
  Answer-pairs and processing of continuous nearest-neighbor queries. FOMC 2011: 16-24
• 
  Magnus Skjegstad, Torleiv Maseng:
  Low complexity set reconciliation using Bloom filters. FOMC 2011: 33-41
• 
  Augustin Chaintreau, Dariusz R. Kowalski:
  FOMC'11, The Seventh ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (part of FCRC 2011), San Jose, CA, USA, June 9, 2011, Proceedings. ACM 2011, ISBN 978-1-4503-0779-6 [contents]
• 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

skipping 128 more matches