Остановите войну!
for scientists:
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 161 matches
- 2018
- Ehsan Kazemi, Liqiang Wang:
A Proximal Zeroth-Order Algorithm for Nonconvex Nonsmooth Problems. Allerton 2018: 64-71 - Abubakar Abid, James Y. Zou:
A Stochastic Expectation-Maximization Approach to Shuffled Linear Regression. Allerton 2018: 470-477 - Imad Ahmad, Chih-Chun Wang:
Flexible Fractional Repetition Codes for Distributed Storage Networks. Allerton 2018: 805-812 - Mohamadreza Ahmadi, Suda Bharadwaj, Takashi Tanaka, Ufuk Topcu:
Stochastic Games with Sensing Costs. Allerton 2018: 275-282 - Mohamadreza Ahmadi, Murat Cubuktepe, Nils Jansen, Ufuk Topcu:
Verification of Uncertain POMDPs Using Barrier Certificates. Allerton 2018: 115-122 - Syed Eqbal Alam, Robert Shorten, Fabian Wirth, Jia Yuan Yu:
Derandomized Distributed Multi-resource Allocation with Little Communication Overhead. Allerton 2018: 84-91 - Matthew Andrews, Lisa Zhang:
Structure of Utility Optimization in Regular and Irregular Wireless Scenarios. Allerton 2018: 399-406 - Ahmed H. Anwar, George K. Atia, Mina Guirguis:
Toward a Protected Cloud Against Side Channel Attacks: A Game-Theoretic Framework. Allerton 2018: 78-83 - Ahmed Arafa, Jing Yang, Sennur Ulukus, H. Vincent Poor:
Online Timely Status Updates with Erasures for Energy Harvesting Sensors. Allerton 2018: 966-972 - Meysam Asadi, Natasha Devroye:
On the zero-error capacity of channels with rate limited noiseless feedback. Allerton 2018: 1141-1146 - Elie Atallah, Nazanin Rahnavard:
A Code-Based Distributed Gradient Descent Method. Allerton 2018: 951-958 - Brendan Badia, Randall Berry, Ermin Wei:
Price and Capacity Competition for EV parking with Government Mandates. Allerton 2018: 583-589 - Islam El Bakoury, Bobak Nazer:
Uplink-Downlink Duality For Integer-Forcing in Cloud Radio Access Networks. Allerton 2018: 39-47 - Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Johannes Rauh:
Unique Informations and Deficiencies. Allerton 2018: 32-38 - Leighton Pate Barnes, Yanjun Han, Ayfer Özgür:
A Geometric Characterization of Fisher Information from Quantized Samples with Applications to Distributed Statistical Estimation. Allerton 2018: 16-23 - Melih Bastopcu, Sennur Ulukus:
Age of Information with Soft Updates. Allerton 2018: 378-385 - Allison Beemer, Ryan Coatney, Venkatesan Guruswami, Hiram H. Lopez, Fernando Piñero:
Explicit optimal-length locally repairable codes of distance 5. Allerton 2018: 800-804 - Amir Behrouzi-Far, Emina Soljanin:
On the Effect of Task-to-Worker Assignment in Distributed Computing Systems with Stragglers. Allerton 2018: 560-566 - Alankrita Bhatt, Jiun-Ting Huang, Young-Han Kim, J. Jon Ryu, Pinar Sen:
Monte Carlo Methods for Randomized Likelihood Decoding. Allerton 2018: 204-211 - Thomas Bonald, Alexandre Hollocou, Marc Lelarge:
Weighted Spectral Embedding of Graphs. Allerton 2018: 494-501 - Vivek S. Borkar, Sarath Pattathil:
Concentration bounds for two time scale stochastic approximation. Allerton 2018: 504-511 - Matija Bucic, Melkior Ornik, Ufuk Topcu:
Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems. Allerton 2018: 297-304 - Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Strong Coordination over Noisy Channels with Strictly Causal Encoding. Allerton 2018: 519-526 - Jinyuan Chen:
Secure Communication over Interference Channel: To Jam or Not to Jam? Allerton 2018: 1120-1127 - Zitan Chen, Alexander Barg:
The repair problem under connectivity constraints: Explicit MSR codes for the rack-aware model of distributed storage. Allerton 2018: 710-714 - Juntao Chen, Quanyan Zhu:
A Linear Quadratic Differential Game Approach to Dynamic Contract Design for Systemic Cyber Risk Management under Asymmetric Information. Allerton 2018: 575-582 - Mahdi Cheraghchi, João Ribeiro:
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. Allerton 2018: 1104-1111 - Il Yong Chun, Hongki Lim, Zhengyu Huang, Jeffrey A. Fessler:
Fast and convergent iterative image recovery using trained convolutional neural networks. Allerton 2018: 155-159 - Hye Won Chung, Ji Oon Lee, Doyeon Kim, Alfred O. Hero III:
Trade-offs Between Query Difficulty and Sample Complexity in Crowdsourced Data Acquisition. Allerton 2018: 639-646 - Richard Combes, Stefan Magureanu, Alexandre Proutière:
Generic Asymptotically Optimal Algorithms for Multi-Armed Bandits. Allerton 2018: 152
skipping 131 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-03-28 12:54 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