Остановите войну!
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 79 matches
- 1995
- Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen:
Parallel randomized load balancing (Preliminary Version). STOC 1995: 238-247 - Yehuda Afek, Dalia Dauber, Dan Touitou:
Wait-free made fast (Extended Abstract). STOC 1995: 538-547 - Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki:
Motion planning for a steering-constrained robot through moderate obstacles. STOC 1995: 343-352 - William Aiello, Mihir Bellare, Ramarathnam Venkatesan:
Knowledge on the average-perfect, statistical and logarithmic. STOC 1995: 469-478 - Rajeev Alur, Costas Courcoubetis, Mihalis Yannakakis:
Distinguishing tests for nondeterministic and probabilistic machines. STOC 1995: 363-372 - Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Computing faces in segment and simplex arrangements (Preliminary Version). STOC 1995: 672-682 - Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in linear time? STOC 1995: 427-436 - Arne Andersson, Johan Håstad, Ola Petersson:
A tight lower bound for searching a sorted array. STOC 1995: 417-426 - Sanjeev Arora, David R. Karger, Marek Karpinski:
Polynomial time approximation schemes for dense instances of NP-hard problems. STOC 1995: 284-293 - Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498 - Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh S. Vempala:
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. STOC 1995: 277-283 - Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber:
Bandwidth allocation with preemption. STOC 1995: 616-625 - Robert Beals, Tetsuro Nishino, Keisuke Tanaka:
More on the complexity of negation-limited circuits. STOC 1995: 585-595 - Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi:
The relative complexity of NP search problems. STOC 1995: 303-314 - Mihir Bellare, Oded Goldreich, Shafi Goldwasser:
Incremental cryptography and application to virus protection. STOC 1995: 45-56 - Mihir Bellare, Phillip Rogaway:
Provably secure session key distribution: the three party case. STOC 1995: 57-66 - Avrim Blum, Prasad Chalasani, Santosh S. Vempala:
A constant-factor approximation for the k-MST problem in the plane. STOC 1995: 294-302 - Maria Luisa Bonet, Toniann Pitassi, Ran Raz:
Lower bounds for cutting planes proofs with small coefficients. STOC 1995: 575-584 - Al Borchers, Ding-Zhu Du:
The k-Steiner ratio in graphs. STOC 1995: 641-649 - Nader H. Bshouty, Christino Tamon:
On the Fourier spectrum of monotone functions (Extended Abstract). STOC 1995: 219-228 - Ran Canetti, Sandy Irani:
Bounding the power of preemption in randomized scheduling. STOC 1995: 606-615 - Bernard Chazelle:
Lower bounds for off-line range searching. STOC 1995: 733-740 - Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther:
On real Turing machines that toss coins. STOC 1995: 335-342 - Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski:
Work-time-optimal parallel algorithms for string problems. STOC 1995: 713-722 - Persi Diaconis, Laurent Saloff-Coste:
What do we know about the Metropolis algorithm? STOC 1995: 112-129 - Yefim Dinitz, Zeev Nutov:
A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. STOC 1995: 509-518 - Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg:
Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract). STOC 1995: 528-537 - Jeff Edmonds, Chung Keung Poon:
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model. STOC 1995: 147-156 - David Eppstein:
Geometric lower bounds for parametric matroid optimization. STOC 1995: 662-671 - Funda Ergün:
Testing multivariate linear functions: overcoming the generator bottleneck. STOC 1995: 407-416
skipping 49 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-08-24 12:15 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