Остановите войну!
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 57 matches
- 2015
- Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. SIAM J. Comput. 44(4): 1089-1118 (2015) - Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In. SIAM J. Comput. 44(6): 1601-1625 (2015) - Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. SIAM J. Comput. 44(1): 160-192 (2015) - Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins:
Low-Distortion Inference of Latent Similarities from a Multiplex Social Network. SIAM J. Comput. 44(3): 617-668 (2015) - Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. 44(3): 669-697 (2015) - Dorit Aharonov, Lior Eldar:
Quantum Locally Testable Codes. SIAM J. Comput. 44(5): 1230-1262 (2015) - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters:
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys. SIAM J. Comput. 44(2): 433-466 (2015) - Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer:
Minimum Congestion Mapping in a Cloud. SIAM J. Comput. 44(3): 819-843 (2015) - Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. SIAM J. Comput. 44(5): 1287-1324 (2015) - Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O(log n) Update Time. SIAM J. Comput. 44(1): 88-113 (2015) - Mikhail Belkin, Kaushik Sinha:
Polynomial Learning of Distribution Families. SIAM J. Comput. 44(4): 889-911 (2015) - Eli Ben-Sasson, Noga Ron-Zewi:
From Affine to Two-Source Extractors via Approximate Duality. SIAM J. Comput. 44(6): 1670-1697 (2015) - András A. Benczúr, David R. Karger:
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. SIAM J. Comput. 44(2): 290-319 (2015) - Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44(3): 513-539 (2015) - Nir Bitansky, Omer Paneth:
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. SIAM J. Comput. 44(5): 1325-1383 (2015) - Eric Blais, Li-Yang Tan:
Approximating Boolean Functions with Depth-2 Circuits. SIAM J. Comput. 44(6): 1583-1600 (2015) - Eric Blais, Amit Weinstein, Yuichi Yoshida:
Partially Symmetric Functions Are Efficiently Isomorphism Testable. SIAM J. Comput. 44(2): 411-432 (2015) - Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec:
Anisotropic Delaunay Mesh Generation. SIAM J. Comput. 44(2): 467-512 (2015) - Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. SIAM J. Comput. 44(6): 1626-1649 (2015) - Mark Braverman:
Interactive Information Complexity. SIAM J. Comput. 44(6): 1698-1739 (2015) - Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner:
Smoothed Analysis of the Successive Shortest Path Algorithm. SIAM J. Comput. 44(6): 1798-1819 (2015) - Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - Jan Bulánek, Michal Koucký, Michael E. Saks:
Tight Lower Bounds for the Online Labeling Problem. SIAM J. Comput. 44(6): 1765-1797 (2015) - Clément L. Canonne, Dana Ron, Rocco A. Servedio:
Testing Probability Distributions using Conditional Samples. SIAM J. Comput. 44(3): 540-616 (2015) - T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon:
New Doubling Spanners: Better and Simpler. SIAM J. Comput. 44(1): 37-53 (2015) - Bernard Chazelle:
Diffusive Influence Systems. SIAM J. Comput. 44(5): 1403-1442 (2015) - Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity Flows and Cuts in Polymatroidal Networks. SIAM J. Comput. 44(4): 912-943 (2015) - Yoann Dieudonné, Andrzej Pelc, Vincent Villain:
How to Meet Asynchronously at Polynomial Cost. SIAM J. Comput. 44(3): 844-867 (2015) - Andrew Drucker:
New Limits to Classical and Quantum Instance Compression. SIAM J. Comput. 44(5): 1443-1479 (2015) - Michael Elkin, Shay Solomon:
Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones. SIAM J. Comput. 44(4): 996-1025 (2015)
skipping 27 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 15:50 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