![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 62 matches
- 2017
- Soroush Alamdari, Patrizio Angelini
, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo
, Giuseppe Di Battista, Fabrizio Frati
, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli
, Sahil Singla, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Shie Mannor
, Yishay Mansour, Ohad Shamir:
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. SIAM J. Comput. 46(6): 1785-1826 (2017) - Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. SIAM J. Comput. 46(1): 272-306 (2017) - Per Austrin, Venkatesan Guruswami, Johan Håstad:
(2+ε)-Sat Is NP-hard. SIAM J. Comput. 46(5): 1554-1573 (2017) - Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
The "Runs" Theorem. SIAM J. Comput. 46(5): 1501-1514 (2017) - Xiaohui Bei
, Ning Chen, Nick Gravin, Pinyan Lu
:
Worst-Case Mechanism Design via Bayesian Analysis. SIAM J. Comput. 46(4): 1428-1448 (2017) - Salman Beigi, Omid Etesami, Amin Gohari
:
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. SIAM J. Comput. 46(1): 1-36 (2017) - Glencora Borradaile, Philip N. Klein, Shay Mozes
, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. SIAM J. Comput. 46(4): 1280-1303 (2017) - Christos Boutsidis, David P. Woodruff:
Optimal CUR Matrix Decompositions. SIAM J. Comput. 46(2): 543-589 (2017) - Mark Braverman, Klim Efremenko
:
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. SIAM J. Comput. 46(1): 388-428 (2017) - Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter
:
Membership in Moment Polytopes is in NP and coNP. SIAM J. Comput. 46(3): 972-991 (2017) - Sergio Cabello
, Josef Cibulka, Jan Kyncl
, Maria Saumell
, Pavel Valtr:
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46(5): 1574-1602 (2017) - Jin-Yi Cai, Pinyan Lu
, Mingji Xia:
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. SIAM J. Comput. 46(3): 853-889 (2017) - Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov:
Rumor Spreading with No Dependence on Conductance. SIAM J. Comput. 46(1): 58-79 (2017) - André Chailloux, Iordanis Kerenidis:
Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment. SIAM J. Comput. 46(5): 1647-1677 (2017) - Ho-Lin Chen, David Doty
:
Parallelism and Time in Hierarchical Self-Assembly. SIAM J. Comput. 46(2): 661-709 (2017) - Danny Z. Chen, Ziyun Huang
, Yangwei Liu, Jinhui Xu:
On Clustering Induced Voronoi Diagrams. SIAM J. Comput. 46(6): 1679-1711 (2017) - Andrew M. Childs
, Robin Kothari
, Rolando D. Somma:
Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision. SIAM J. Comput. 46(6): 1920-1950 (2017) - Julia Chuzhoy, Alexander Russell:
Special Section on the Fifty-Fifth Annual ACM Symposium on Foundations of Coomputer Science (FOCS 2014). SIAM J. Comput. 46(1): 160 (2017) - Roee David, Irit Dinur
, Elazar Goldenberg, Guy Kindler, Igor Shinkar:
Direct Sum Testing. SIAM J. Comput. 46(4): 1336-1369 (2017) - Talya Eden, Amit Levi
, Dana Ron
, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. SIAM J. Comput. 46(5): 1603-1646 (2017) - Alina Ene, Sariel Har-Peled
, Benjamin Raichel:
Geometric Packing under Nonuniform Constraints. SIAM J. Comput. 46(6): 1745-1784 (2017) - Juan Luis Esteban
, Ramon Ferrer-i-Cancho
:
A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees. SIAM J. Comput. 46(3): 1146-1151 (2017) - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. SIAM J. Comput. 46(5): 1515-1553 (2017) - Uriel Feige, Tomer Koren, Moshe Tennenholtz:
Chasing Ghosts: Competing with Stateful Policies. SIAM J. Comput. 46(1): 190-223 (2017) - David Gamarnik, Madhu Sudan:
Performance of Sequential Local Algorithms for the Random NAE-K-SAT Problem. SIAM J. Comput. 46(2): 590-619 (2017) - Pu Gao, Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs. SIAM J. Comput. 46(4): 1395-1427 (2017) - Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson:
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation. SIAM J. Comput. 46(1): 114-131 (2017) - Ran Gelles, Bernhard Haeupler:
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. SIAM J. Comput. 46(4): 1449-1472 (2017) - Gianluigi Greco, Francesco Scarcello
:
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems. SIAM J. Comput. 46(3): 1111-1145 (2017)
skipping 32 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-19 10:53 CEST 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