Остановите войну!
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 63 matches
- 2014
- Ittai Abraham, Shiri Chechik, Kunal Talwar:
Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier. APPROX-RANDOM 2014: 1-16 - Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. APPROX-RANDOM 2014: 17-33 - Noga Alon, Troy Lee, Adi Shraibman:
The Cover Number of a Matrix and its Algorithmic Applications. APPROX-RANDOM 2014: 34-47 - Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik:
The Condensation Phase Transition in Random Graph Coloring. APPROX-RANDOM 2014: 449-464 - Siddharth Barman, Shuchi Chawla, Seeun Umboh:
Network Design with Coverage Costs. APPROX-RANDOM 2014: 48-63 - Kshipra Bhawalkar, Sreenivas Gollapudi, Debmalya Panigrahi:
Online Set Cover with Set Requests. APPROX-RANDOM 2014: 64-79 - Eric Blais, Joshua Brody, Badih Ghazi:
The Information Complexity of Hamming Distance. APPROX-RANDOM 2014: 465-489 - Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz:
An Approximate Version of the Tree Packing Conjecture via Random Embeddings. APPROX-RANDOM 2014: 490-499 - Milan Bradonjic, Will Perkins:
On Sharp Thresholds in Random Geometric Graphs. APPROX-RANDOM 2014: 500-514 - Gábor Braun, Samuel Fiorini, Sebastian Pokutta:
Average Case Polyhedral Complexity of the Maximum Stable Set Problem. APPROX-RANDOM 2014: 515-530 - Vladimir Braverman, Jonathan Katzman, Charles Seidell, Gregory Vorsanger:
An Optimal Algorithm for Large Frequency Moments Using O(n(1-2/k)) Bits. APPROX-RANDOM 2014: 531-544 - Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Certifying Equality With Limited Interaction. APPROX-RANDOM 2014: 545-581 - Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda:
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM 2014: 582-595 - Arkadev Chattopadhyay, Michael E. Saks:
The Power of Super-logarithmic Number of Players. APPROX-RANDOM 2014: 596-603 - Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi:
On Reconstructing a Hidden Permutation. APPROX-RANDOM 2014: 604-617 - Eden Chlamtác, Michael Dinitz:
Lowest Degree k-Spanner: Approximation and Hardness. APPROX-RANDOM 2014: 80-95 - Gil Cohen, Anat Ganor, Ran Raz:
Two Sides of the Coin Problem. APPROX-RANDOM 2014: 618-629 - Michael S. Crouch, Daniel M. Stubbs:
Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching. APPROX-RANDOM 2014: 96-104 - Amit Deshpande, Rakesh Venkat:
Guruswami-Sinop Rounding without Higher Level Lasserre. APPROX-RANDOM 2014: 105-114 - Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption Time of the Moran Process. APPROX-RANDOM 2014: 630-642 - Michael Dinitz, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. APPROX-RANDOM 2014: 115-127 - Chandan K. Dubey, Thomas Holenstein:
Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power. APPROX-RANDOM 2014: 643-653 - Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. APPROX-RANDOM 2014: 128-143 - Alina Ene, Jan Vondrák:
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture. APPROX-RANDOM 2014: 144-159 - Moran Feldman, Rani Izsak:
Constrained Monotone Function Maximization and the Supermodular Degree. APPROX-RANDOM 2014: 160-175 - Michal Feldman, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg:
Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks. APPROX-RANDOM 2014: 192-208 - Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità:
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM 2014: 176-191 - Nathanaël François, Rahul Jain, Frédéric Magniez:
Unidirectional Input/Output Streaming Complexity of Reversal and Sorting. APPROX-RANDOM 2014: 654-668 - Hu Fu, Robert D. Kleinberg:
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication. APPROX-RANDOM 2014: 669-676 - Takuro Fukunaga, Afshin Nikzad, R. Ravi:
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem. APPROX-RANDOM 2014: 209-225
skipping 33 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-05-28 12:10 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