![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 36 matches
- 1993
- Yehuda Afek, Danny Hendler:
On the Complexity of Global Computation in the Presence of Link Failures: The General Case. ISTCS 1993: 160-166 - Mihir Bellare:
Interactive Proofs and Approximation: Reduction from Two Provers in One Round. ISTCS 1993: 266-274 - Amir Ben-Dor, Shai Halevi:
Zero-One Permanent is #P-Complete, A Simpler Proof. ISTCS 1993: 108-117 - Liming Cai, Jianer Chen:
On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems. ISTCS 1993: 118-126 - Shiva Chaudhuri:
A Lower Bound for Linear Approximate Compaction. ISTCS 1993: 25-32 - Edith Cohen:
Using Selective Path-Doubling for Parallel Shortest-Path Computations. ISTCS 1993: 78-87 - Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick:
Which Patterns are Hard to Find? ISTCS 1993: 59-68 - Anne Condon, Diane Hernek:
Random Walks on Colored Graphs. ISTCS 1993: 134-140 - Yefim Dinitz:
Maintaining the 4-Edge-Connected Components of a Graph On-Line. ISTCS 1993: 88-97 - Danny Dolev, Yuval Harari, Michal Parnas:
Finding the Neighborhood of a Query in a Dictionary. ISTCS 1993: 33-42 - Alon Efrat, Craig Gotsman:
Subpixel Image Registration Using Circular Fiducials. ISTCS 1993: 49-58 - Ran El-Yaniv, Richard M. Karp:
The Mortgage Problem. ISTCS 1993: 304-312 - Amos Fiat, Moty Ricklin:
Competitive Algorithms for the Weighted Server Problem. ISTCS 1993: 294-303 - Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung:
Efficient On-Line Call Control Algorithms. ISTCS 1993: 285-293 - Shafi Goldwasser:
Efficient Interactive Proofs and Applications to Approximation. ISTCS 1993: 1-2 - Ronald I. Greenberg, Jau-Der Shih:
Feasible Offset an Optimal Offset for Single-Layer Channel Routing. ISTCS 1993: 193-201 - Johan Håstad, Steven J. Phillips, Shmuel Safra
:
A Well-Characterized Approximation Problem. ISTCS 1993: 261-265 - Alon Itai, Hadas Shachnai:
Adaptive Source Routing in High-Speed Networks. ISTCS 1993: 212-221 - Sanjeev Khanna, Nathan Linial, Shmuel Safra
:
On the Hardness of Approximating the Chromatic Number. ISTCS 1993: 250-260 - Zurab Khasidashvili:
On the Equivalence of Persistent Term Rewriting Systems and Recursive Program Schemes. ISTCS 1993: 240-249 - Joost N. Kok, Peter M. W. Knijnenburg:
Divergence Models for Atomized Statements and Parallel Choice. ISTCS 1993: 231-239 - Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir:
The Las-Vegas Processor Identity Problem (How and When to Be Unique). ISTCS 1993: 150-159 - Thomas Lengauer:
Algorithmic Research Problems in Molecular Bioinformatics. ISTCS 1993: 177-192 - Nathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks:
Sphere Packing and Local Majorities in Graphs. ISTCS 1993: 141-149 - Michael Luby, Alistair Sinclair, David Zuckerman:
Optimal Speedup of Las Vegas Algorithms. ISTCS 1993: 128-133 - Michael Luby, Boban Velickovic
, Avi Wigderson:
Deterministic Approximate Counting of Depth-2 Circuits. ISTCS 1993: 18-24 - Nimrod Megiddo, Moni Naor, David P. Anderson:
The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS 1993: 43-48 - Ilan Newman, Assaf Schuster:
Hot-Potato Worm Routing is Almost as Easy as Store-and-Forward Packet Routing. ISTCS 1993: 202-211 - Rafail Ostrovsky, Avi Wigderson:
One-Way Fuctions are Essential for Non-Trivial Zero-Knowledge. ISTCS 1993: 3-17 - David Peleg, Gideon Schechtman, Avishai Wool:
Approximating Bounded 0-1 Integer Linear Programs. ISTCS 1993: 69-77
skipping 6 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-11 18: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