![](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 61 matches
- 2003
- Juhi-Lian Julian Ting:
Causalities of the Taiwan Stock Market. CoRR cond-mat/0304132 (2003) - Stephen A. Fenner:
A Physics-Free Introduction to the Quantum Computation Model. CoRR cs.CC/0304008 (2003) - Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Individual Communication Complexity. CoRR cs.CC/0304012 (2003) - Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A direct sum theorem in communication complexity via message compression. CoRR cs.CC/0304020 (2003) - Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev:
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. CoRR cs.CC/0304026 (2003) - John M. Hitchcock:
Small Spans in Scaled Dimension. CoRR cs.CC/0304030 (2003) - Sanjeev Arora:
How NP got a new definition: a survey of probabilistically checkable proofs. CoRR cs.CC/0304038 (2003) - Uriel Feige:
Approximation thresholds for combinatorial optimization problems. CoRR cs.CC/0304039 (2003) - Russell Impagliazzo:
Hardness as randomness: a survey of universal derandomization. CoRR cs.CC/0304040 (2003) - Ran Raz:
P != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle. CoRR cs.CC/0304041 (2003) - Michael N. Vyalyi:
Hardness of approximating the weight enumerator of a binary linear code. CoRR cs.CC/0304044 (2003) - Gilles Daniel:
Stochastic Volatility in a Quantitative Model of Stock Market Returns. CoRR cs.CE/0304009 (2003) - John Robert Burger:
Symmetric and Antisymmeteric Functions, a New Way to Test a Quantum Computer. CoRR cs.CE/0304016 (2003) - Mirela Damian-Iordache, Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. CoRR cs.CG/0304023 (2003) - Joseph O'Rourke:
Computational Geometry Column 44. CoRR cs.CG/0304025 (2003) - Regina Barzilay, Lillian Lee:
Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence Alignment. CoRR cs.CL/0304006 (2003) - David N. Levin:
Blind Normalization of Speech From Different Channels. CoRR cs.CL/0304019 (2003) - Victor Kromer:
Glottochronologic Retrognostic of Language System. CoRR cs.CL/0304024 (2003) - Lillian Lee:
"I'm sorry Dave, I'm afraid I can't do that": Linguistics, Statistics and Natural Language Processing circa 2001. CoRR cs.CL/0304027 (2003) - Dietmar F. Rösner, Manuela Kunze:
An XML based Document Suite. CoRR cs.CL/0304029 (2003) - Dietmar F. Rösner, Manuela Kunze:
Exploiting Sublanguage and Domain Characteristics in a Bootstrapping Approach to Lexicon and Ontology Creation. CoRR cs.CL/0304035 (2003) - Manuela Kunze, Chun Xiao:
An Approach for Resource Sharing in Multilingual NLP. CoRR cs.CL/0304036 (2003) - Boaz Tsaban, Uzi Vishne:
Efficient linear feedback shift registers with maximal period. CoRR cs.CR/0304010 (2003) - Ilia Toli:
Hidden Polynomial(s) Cryptosystems. CoRR cs.CR/0304013 (2003) - Andreas J. Winter, Anderson C. A. Nascimento, Hideki Imai:
Commitment Capacity of Discrete Memoryless Channels. CoRR cs.CR/0304014 (2003) - Douglas A. Galbi:
Transforming the Structure of Network Interconnection and Transport. CoRR cs.CY/0304031 (2003) - Douglas A. Galbi:
Growth in the "New Economy": U.S. Bandwidth Use and Pricing Across the 1990s. CoRR cs.CY/0304032 (2003) - Douglas A. Galbi:
A New Account of Personalization and Effective Communication. CoRR cs.CY/0304033 (2003) - Douglas A. Galbi:
Revolutionary Ideas for Radio Regulation. CoRR cs.CY/0304034 (2003) - Baden Hughes, Steven Bird:
Grid-Enabling Natural Language Engineering By Stealth. CoRR cs.DC/0304028 (2003)
skipping 31 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-08-18 11:07 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