Остановите войну!
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 51 matches
- 2015
- Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan:
Approximate Verification of the Symbolic Dynamics of Markov Chains. J. ACM 62(1): 2:1-2:34 (2015) - Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys:
Improving Christofides' Algorithm for the s-t Path TSP. J. ACM 62(5): 34:1-34:28 (2015) - Matthew Anderson, Anuj Dawar, Bjarki Holm:
Solving Linear Programs without Breaking Abstractions. J. ACM 62(6): 48:1-48:26 (2015) - Sanjeev Arora, Boaz Barak, David Steurer:
Subexponential Algorithms for Unique Games and Related Problems. J. ACM 62(5): 42:1-42:25 (2015) - James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 62(1): 3:1-3:22 (2015) - Haim Avron, Alex Druinsky, Anshul Gupta:
Revisiting Asynchronous Linear Solvers: Provable Convergence Rate through Randomization. J. ACM 62(6): 51:1-51:27 (2015) - Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins:
Truthful Mechanisms with Implicit Payment Computation. J. ACM 62(2): 10:1-10:37 (2015) - Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. J. ACM 62(5): 40:1-40:49 (2015) - Vince Bárány, Balder ten Cate, Luc Segoufin:
Guarded Negation. J. ACM 62(3): 22:1-22:26 (2015) - Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie:
Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems. J. ACM 62(2): 14:1-14:33 (2015) - David A. Basin, Felix Klaedtke, Samuel Müller, Eugen Zalinescu:
Monitoring Metric First-Order Temporal Properties. J. ACM 62(2): 15:1-15:45 (2015) - Manuel Bodirsky, Michael Pinsker:
Schaefer's Theorem for Graphs. J. ACM 62(3): 19:1-19:52 (2015) - Ilario Bonacina, Nicola Galesi:
A Framework for Space Complexity in Algebraic Proof Systems. J. ACM 62(3): 23:1-23:20 (2015) - Tobias Brunsch, Heiko Röglin:
Improved Smoothed Analysis of Multiobjective Optimization. J. ACM 62(1): 4:1-4:58 (2015) - Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh:
Measuring and Synthesizing Systems in Probabilistic Environments. J. ACM 62(1): 9:1-9:34 (2015) - Flavio Chierichetti, Ravi Kumar:
LSH-Preserving Functions and Their Applications. J. ACM 62(5): 33:1-33:25 (2015) - Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. J. ACM 62(4): 28:1-28:30 (2015) - Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages Are Church-Rosser Congruential. J. ACM 62(5): 39:1-39:20 (2015) - Michael Elkin, Shay Solomon:
Optimal Euclidean Spanners: Really Short, Thin, and Lanky. J. ACM 62(5): 35:1-35:45 (2015) - Kousha Etessami, Mihalis Yannakakis:
Recursive Markov Decision Processes and Recursive Stochastic Games. J. ACM 62(2): 11:1-11:69 (2015) - Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Document Spanners: A Formal Approach to Information Extraction. J. ACM 62(2): 12:1-12:51 (2015) - Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
Exponential Lower Bounds for Polytopes in Combinatorial Optimization. J. ACM 62(2): 17:1-17:23 (2015) - Peter Franek, Marek Krcál:
Robust Satisfiability of Systems of Equations. J. ACM 62(4): 26:1-26:19 (2015) - Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. J. ACM 62(6): 50:1-50:60 (2015) - Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Polyhedral Clinching Auctions and the AdWords Polytope. J. ACM 62(3): 18:1-18:27 (2015) - Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
Delegating Computation: Interactive Proofs for Muggles. J. ACM 62(4): 27:1-27:64 (2015) - Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Attribute-Based Encryption for Circuits. J. ACM 62(6): 45:1-45:33 (2015) - Bernhard Haeupler:
Simple, Fast and Deterministic Gossip and Rumor Spreading. J. ACM 62(6): 47:1-47:18 (2015) - Sariel Har-Peled, Benjamin Raichel:
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. J. ACM 62(6): 44:1-44:35 (2015) - Rahul Jain:
New Strong Direct Product Results in Communication Complexity. J. ACM 62(3): 20:1-20:27 (2015)
skipping 21 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-06-01 07:03 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