Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew P. Johnson 0001
Person information
- affiliation: Lehman College, Department of Mathematics and Computer Science, New York City, NY, USA
- affiliation: City University of New York, Department of Computer Science, NY, USA
- affiliation: University of California, Los Angeles, CA, USA
- affiliation: University of Southern California, Department of Computer Science, Los Angeles, CA, USA
- affiliation: Pennsylvania State University, Department of Computer Science and Engineering, University Park, PA, USA
- affiliation: Columbia University, Department of Computer Science, New York, NY, USA
Other persons with the same name
- Matthew P. Johnson — disambiguation page
- Matthew P. Johnson 0002
![[0000-0002-1663-0205]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-1663-0205")
(aka: Matt Johnson 0004) — University of Sheffield, Department of Molecular Biology and Biotechnology, UK (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j16]Matthew P. Johnson, Levi Rybalov, Liang Zhao, Samuel Bald:
Maximizing power production in path and tree riverine networks. Sustain. Comput. Informatics Syst. 22: 300-310 (2019)- 2018
- [j15]Matthew P. Johnson, Liang Zhao, Supriyo Chakraborty:
Achieving Pareto-Optimal MI-Based Privacy-Utility Tradeoffs Under Full Data. IEEE J. Sel. Top. Signal Process. 12(5): 1093-1105 (2018) - 2017
- [j14]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. Algorithmica 79(3): 708-741 (2017) - [j13]Matthew P. Johnson, Brian Phelan, Amotz Bar-Noy, Prithwish Basu, Ram Ramanathan:
Minimum-Cost Network-Wide Broadcast over Reliable MAC-Layer Multicast. IEEE Trans. Mob. Comput. 16(12): 3390-3402 (2017) - 2015
- [j12]Yosef Alayev, Amotz Bar-Noy, Matthew P. Johnson, Lance M. Kaplan, Thomas F. La Porta:
You can't get there from here: sensor scheduling with refocusing delays. Wirel. Networks 21(5): 1683-1698 (2015) - 2014
- [j11]Matthew P. Johnson, Alexander Gutfraind, Kiyan Ahmadizadeh:
Evader interdiction: algorithms, complexity and collateral damage. Ann. Oper. Res. 222(1): 341-359 (2014) - [j10]Yosef Alayev, Fangfei Chen, Yun Hou, Matthew P. Johnson, Amotz Bar-Noy, Thomas F. La Porta, Kin K. Leung:
Throughput Maximization in Mobile WSN Scheduling With Power Control and Rate Selection. IEEE Trans. Wirel. Commun. 13(7): 4066-4079 (2014) - 2013
- [j9]Wei Ren, Qing Zhao, Ram Ramanathan, Jianhang Gao, Ananthram Swami, Amotz Bar-Noy, Matthew P. Johnson, Prithwish Basu:
Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes. Wirel. Networks 19(6): 1121-1133 (2013) - 2012
- [j8]Fangfei Chen, Matthew P. Johnson, Yosef Alayev, Amotz Bar-Noy, Thomas F. La Porta:
Who, When, Where: Timeslot Assignment to Mobile Clients. IEEE Trans. Mob. Comput. 11(1): 73-85 (2012) - [j7]Matthew P. Johnson, Deniz Sariöz, Amotz Bar-Noy, Theodore Brown, Dinesh C. Verma, Chai Wah Wu:
More is more: The benefits of denser sensor deployment. ACM Trans. Sens. Networks 8(3): 22:1-22:19 (2012) - [j6]Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, Thomas F. La Porta:
Proactive data dissemination to mission sites. Wirel. Networks 18(7): 749-762 (2012) - 2011
- [j5]Matthew P. Johnson, Amotz Bar-Noy, Ou Liu, Yi Feng:
Energy peak shaving with local storage. Sustain. Comput. Informatics Syst. 1(3): 177-188 (2011) - 2010
- [j4]Hosam Rowaihy, Matthew P. Johnson, Ou Liu, Amotz Bar-Noy, Theodore Brown, Thomas La Porta:
Sensor-mission assignment in wireless sensor networks. ACM Trans. Sens. Networks 6(4): 36:1-36:33 (2010) - [j3]Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart W. Chalmers, Thomas La Porta, Alun D. Preece:
Sensor-Mission Assignment in Constrained Environments. IEEE Trans. Parallel Distributed Syst. 21(11): 1692-1705 (2010) - 2009
- [j2]Sharanya Eswaran, Matthew P. Johnson, Archan Misra, Thomas La Porta:
Distributed utility-based rate adaptation protocols for prioritized, quasi-elastic flows. ACM SIGMOBILE Mob. Comput. Commun. Rev. 13(1): 2-13 (2009) - 2008
- [j1]Matthew P. Johnson, Rohit Parikh:
Probabilistic Conditionals are Almost Monotonic. Rev. Symb. Log. 1(1): 73-80 (2008)
Conference and Workshop Papers
- 2019
- [c49]Matthew P. Johnson:
Turing Tumble Is P(SPACE)-Complete. CIAC 2019: 274-285 - 2018
- [c48]Matthew P. Johnson:
Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete. ISAAC 2018: 12:1-12:13 - 2017
- [c47]Itai Feigenbaum, Matthew P. Johnson:
Selfish Knapsack. AAAI 2017: 509-515 - [c46]Kin Sum Liu, Tyler Mayer, Hao-Tsung Yang, Esther M. Arkin, Jie Gao, Mayank Goswami, Matthew P. Johnson, Nirman Kumar, Shan Lin:
Joint sensing duty cycle scheduling for heterogeneous coverage guarantee. INFOCOM 2017: 1-9 - [c45]Matthew P. Johnson, Liang Zhao, Supriyo Chakraborty:
Computing messages that reveal selected inferences while protecting others. ITW 2017: 319-323 - [c44]Jiemin Zeng, Gaurish Telang, Matthew P. Johnson, Rik Sarkar, Jie Gao, Esther M. Arkin, Joseph S. B. Mitchell:
Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity. MobiHoc 2017: 7:1-7:10 - [c43]Elahe Vahdani, Amotz Bar-Noy, Matthew P. Johnson, Tarek F. Abdelzaher:
Gathering Information in Sensor Networks for Synchronized Freshness. SECON 2017: 1-9 - 2016
- [c42]Samuel Bald, Matthew P. Johnson, Ou Liu:
Approximating the Maximum Rectilinear Crossing Number. COCOON 2016: 455-467 - [c41]Samuel Bald, Matthew P. Johnson, Levi Rybalov:
Optimizing regional power production under thermal pollution constraints. IGSC 2016: 1-8 - 2015
- [c40]Amotz Bar-Noy, Matthew P. Johnson, Nooreddin Naghibolhosseini, Dror Rawitz, Simon Shamoun:
The Price of Incorrectly Aggregating Coverage Values in Sensor Selection. DCOSS 2015: 98-107 - [c39]Prithwish Basu, Chi-Kin Chau, Andrei Iu. Bejan, Richard J. Gibbens, Saikat Guha, Matthew P. Johnson:
Efficient multicast in hybrid wireless networks. MILCOM 2015: 306-311 - 2014
- [c38]Prithwish Basu, Feng Yu, Matthew P. Johnson, Amotz Bar-Noy:
Low Expected Latency Routing in Dynamic Networks. MASS 2014: 267-271 - [c37]Matthew P. Johnson, Ou Liu, George Rabanca:
Secluded Path via Shortest Path. SIROCCO 2014: 108-120 - [c36]Felisa J. Vázquez-Abad, Pinhus Dashevsky, Matthew P. Johnson:
LP-Based Approaches to Stationary-Constrained Markov Decision Problems. WODES 2014: 320-325 - 2013
- [c35]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. ESA 2013: 301-312 - [c34]Nan Hu, Diego Pizzocaro, Matthew P. Johnson, Thomas La Porta, Alun D. Preece:
Resource Allocation with Non-deterministic Demands and Profits. MASS 2013: 145-153 - [c33]Philippe Nain, Don Towsley, Amotz Bar-Noy, Prithwish Basu, Matthew P. Johnson, Feng Yu:
Estimating end-to-end delays under changing conditions. CHANTS@MobiCom 2013: 1-6 - [c32]Supriyo Chakraborty, Kasturi Rangan Raghavan, Matthew P. Johnson, Mani B. Srivastava:
A framework for context-aware privacy of sensor data on mobile systems. HotMobile 2013: 11 - 2012
- [c31]Matthew Paul Johnson, Fei Fang, Milind Tambe:
Patrol Strategies to Maximize Pristine Forest Area. AAAI 2012: 295-301 - [c30]Albert Xin Jiang, Zhengyu Yin, Matthew P. Johnson, Milind Tambe, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm:
Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems. AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health 2012 - [c29]Matthew P. Johnson, Fei Fang, Rong Yang, Milind Tambe, Heidi J. Albers:
Challenges in Patrolling to Maximize Pristine Forest Area (Position Paper). AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health 2012 - [c28]Michal Jakob, Zbynek Moler, Antonín Komenda, Zhengyu Yin, Albert Xin Jiang, Matthew Paul Johnson, Michal Pechoucek, Milind Tambe:
AgentPolis: towards a platform for fully agent-based modeling of multi-modal transportation (demonstration). AAMAS 2012: 1501-1502 - [c27]Yosef Alayev, Fangfei Chen, Yun Hou, Matthew P. Johnson, Amotz Bar-Noy, Tom La Porta, Kin K. Leung:
Throughput Maximization in Mobile WSN Scheduling with Power Control and Rate Selection. DCOSS 2012: 33-40 - [c26]Zhengyu Yin, Albert Xin Jiang, Matthew Paul Johnson, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm, Milind Tambe, John P. Sullivan:
TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems. IAAI 2012: 2348-2355 - [c25]Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, Thomas F. La Porta:
Convergecast with aggregatable data classes. SECON 2012: 148-156 - [c24]Amotz Bar-Noy, Yi Gai, Matthew P. Johnson, Bhaskar Krishnamachari, George Rabanca:
Funding Games: The Truth but Not the Whole Truth. WINE 2012: 128-141 - 2011
- [c23]Matthew P. Johnson, Alexander Gutfraind:
Evader Interdiction and Collateral Damage. ALGOSENSORS 2011: 86-100 - [c22]Amotz Bar-Noy, Prithwish Basu, Matthew P. Johnson, Ram Ramanathan:
Minimum-Cost Broadcast through Varying-Size Neighborcast. ALGOSENSORS 2011: 173-187 - [c21]Matthew P. Johnson, Amotz Bar-Noy:
Pan and scan: Configuring cameras for coverage. INFOCOM 2011: 1071-1079 - [c20]Wei Ren, Qing Zhao, Ram Ramanathan, Jianhang Gao, Ananthram Swami, Amotz Bar-Noy, Matthew P. Johnson, Prithwish Basu:
Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes. MASS 2011: 660-665 - 2010
- [c19]Yosef Alayev, Amotz Bar-Noy, Matthew P. Johnson, Lance M. Kaplan, Thomas F. La Porta:
You can't get there from here: Sensor scheduling with refocusing delays. MASS 2010: 462-471 - [c18]Matthew P. Johnson, Amotz Bar-Noy:
Brief announcement: pan and scan. PODC 2010: 120-121 - [c17]Matthew P. Johnson, Amotz Bar-Noy, Mani B. Srivastava:
Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage. SSS 2010: 282-284 - 2009
- [c16]Hosam Rowaihy, Matthew P. Johnson, Diego Pizzocaro, Amotz Bar-Noy, Lance M. Kaplan, Thomas La Porta, Alun D. Preece:
Detection and Localization Sensor Assignment with Exact and Fuzzy Locations. DCOSS 2009: 28-43 - [c15]Sharanya Eswaran, Matthew P. Johnson, Archan Misra, Thomas La Porta:
Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multi-hop Wireless Networks. DCOSS 2009: 87-102 - [c14]Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Ou Liu:
Cheap or Flexible Sensor Coverage. DCOSS 2009: 245-258 - [c13]Matthew P. Johnson, Deniz Sariöz, Amotz Bar-Noy, Theodore Brown, Dinesh C. Verma, Chai Wah Wu:
More is More: The Benefits of Denser Sensor Deployment. INFOCOM 2009: 379-387 - [c12]Fangfei Chen, Matthew P. Johnson, Yosef Alayev, Amotz Bar-Noy, Tom La Porta:
Who, When, Where: Timeslot Assignment to Mobile Clients. MASS 2009: 90-99 - [c11]Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, Iris Fermin, Tom La Porta:
Proactive Data Dissemination to Mission Sites. SECON 2009: 1-9 - 2008
- [c10]Hosam Rowaihy, Matthew P. Johnson, Sharanya Eswaran, Diego Pizzocaro, Amotz Bar-Noy, Thomas La Porta, Archan Misra, Alun D. Preece:
Utility-based joint sensor selection and congestion control for task-oriented WSNs. ACSCC 2008: 1165-1169 - [c9]Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart W. Chalmers, Thomas La Porta, Alun D. Preece:
Frugal Sensor Assignment. DCOSS 2008: 219-236 - [c8]Mario Gomez, Alun D. Preece, Matthew P. Johnson, Geeth de Mel, Wamberto Weber Vasconcelos, Christopher Gibson, Amotz Bar-Noy, Konrad Borowiecki, Thomas La Porta, Diego Pizzocaro, Hosam Rowaihy, Gavin Pearson, Tien Pham:
An Ontology-Centric Approach to Sensor-Mission Assignment. EKAW 2008: 347-363 - [c7]Hosam Rowaihy, Matthew P. Johnson, Amotz Bar-Noy, Theodore Brown, Thomas La Porta:
Assigning Sensors to Competing Missions. GLOBECOM 2008: 44-49 - [c6]Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Deniz Sariöz, Dinesh C. Verma, Chai Wah Wu:
More is more: The benefits of dense sensor deployment. MASS 2008: 514-515 - [c5]Amotz Bar-Noy, Matthew P. Johnson, Ou Liu:
Peak Shaving through Resource Buffering. WAOA 2008: 147-159 - [c4]Amotz Bar-Noy, Yi Feng, Matthew P. Johnson, Ou Liu:
When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries. WEA 2008: 194-207 - 2007
- [c3]Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Thomas La Porta, Ou Liu, Hosam Rowaihy:
Assigning Sensors to Missions with Demands. ALGOSENSORS 2007: 114-125 - 2002
- [c2]Andrew P. Kosoresow, Matthew P. Johnson:
Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms. Australian Joint Conference on Artificial Intelligence 2002: 344-355 - [c1]Matthew P. Johnson, Andrew P. Kosoresow:
Worst-Case Instances and Lower Bounds via Genetic Algorithms. SEAL 2002: 662-681
Informal and Other Publications
- 2015
- [i6]Itai Feigenbaum, Matthew P. Johnson:
Selfish Knapsack. CoRR abs/1510.07358 (2015) - 2013
- [i5]Philippe Nain, Don Towsley, Matthew P. Johnson, Prithwish Basu, Amotz Bar-Noy, Feng Yu:
Computing Traversal Times on Dynamic Markovian Paths. CoRR abs/1303.3660 (2013) - 2012
- [i4]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. CoRR abs/1212.6176 (2012) - 2011
- [i3]Amotz Bar-Noy, Yi Gai, Matthew P. Johnson, Bhaskar Krishnamachari, George Rabanca:
Knapsack Games and the Truth but not the Whole Truth. CoRR abs/1107.2432 (2011) - [i2]Matthew P. Johnson, Alexander Gutfraind:
Evader Interdiction and Collateral Damage. CoRR abs/1108.0894 (2011) - 2010
- [i1]Prithwish Basu, Amotz Bar-Noy, Ram Ramanathan, Matthew P. Johnson:
Modeling and Analysis of Time-Varying Graphs. CoRR abs/1012.0260 (2010)
Coauthor Index
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-08-10 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
