![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 138 matches
- 1997
- Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz:
A Modular Analysis of Network Transmission Protocols. ISTCS 1997: 54-62 - Yehuda Afek, Shlomi Dolev
:
Local Stabilizer. ISTCS 1997: 74-84 - Takao Asano:
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. ISTCS 1997: 24-37 - Yossi Azar, Leah Epstein:
On-Line Load Balancing of Temporary Tasks on Identical Machines. ISTCS 1997: 119-125 - Richard Beigel:
Closure Properties of GapP and #P. ISTCS 1997: 144-146 - Richard Beigel, Richard Chang:
Commutative Queries. ISTCS 1997: 159-165 - Dan Boneh, Richard J. Lipton:
Effect of Operators on Straight Line Complexity. ISTCS 1997: 1-5 - Gilles Brassard, Peter Høyer
:
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. ISTCS 1997: 12-23 - Christian Capelle, Michel Habib:
Graph decompositions and factorizing permutations. ISTCS 1997: 132-143 - Jaime Cohen, Claudio L. Lucchesi:
Minimax relations for T-join packing problems. ISTCS 1997: 38-44 - Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks:
On the totalk-diameter of connection networks. ISTCS 1997: 96-106 - Uriel Feige, Robert Krauthgamer:
Stereoscopic families of permutations, and their applications. ISTCS 1997: 85-95 - Pat Frankel:
Exact Analysis of Exact Change. ISTCS 1997: 107-118 - Bin Fu, Richard Beigel:
A Comparison of Resource-Bounded Molecular Computation Models. ISTCS 1997: 6-11 - Mordecai J. Golin, Assaf Schuster:
Optimal point-to-point broadcast algorithms via lopsided trees. ISTCS 1997: 63-73 - Vladimir Grebinski, Gregory Kucherov:
Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. ISTCS 1997: 166-173 - Yuval Ishai, Eyal Kushilevitz:
Private Simultaneous Messages Protocols with Applications. ISTCS 1997: 174-184 - Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman:
Learning with Queries Corrupted by Classification Noise. ISTCS 1997: 45-53 - Orna Kupferman, Moshe Y. Vardi:
Weak Alternating Automata Are Not That Weak. ISTCS 1997: 147-158 - Ron Shamir, Dekel Tsur:
Faster subtree isomorphism. ISTCS 1997: 126-131 - Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings. IEEE Computer Society 1997, ISBN 0-8186-8037-7 [contents]
- 1996
- Thorsten Altenkirch, Martin Hofmann, Thomas Streicher:
Reduction-Free Normalisation for a Polymorphic System. ISTCS 1996: 146 - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
On the Parallel Computation of Boolean Functions on Unrelated inputs. ISTCS 1996: 155-161 - Baruch Awerbuch, Yossi Azar, Amos Fiat:
Packet Routing via Min-Cost Circuit Routing. ISTCS 1996: 37-42 - Judit Bar-Ilan, Guy Kortsarz, David Peleg:
Generalized Submodular Cover Problems and Applications. ISTCS 1996: 110-118 - Amotz Bar-Noy, Hadas Shachnai, Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation. ISTCS 1996: 119-128 - Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon:
Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS 1996: 16-26 - Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Feasibility and Unfeasibility of Off-Line Processing. ISTCS 1996: 100-109 - Benny Chor, Yuval Ishai:
On Privacy and Partition Arguments. ISTCS 1996: 191-194 - Michael Codish, Vitaly Lagoon:
Type Dependencies for Logic Programs Using ACI-Unification. ISTCS 1996: 136-145
skipping 108 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-07 12:28 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