Остановите войну!
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 228 matches
- 2008
- Scott Aaronson, John Watrous:
Closed Timelike Curves Make Quantum and Classical Computing Equivalent. CoRR abs/0808.2669 (2008) - Yann Bugeaud, Dalia Krieger, Jeffrey O. Shallit:
Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation. CoRR abs/0808.2544 (2008) - Benjamin A. Burton:
Optimizing the double description method for normal surface enumeration. CoRR abs/0808.4050 (2008) - Alexander Feigel, Avraham Englander, Assaf Engel:
Sex is always well worth its two-fold cost. CoRR abs/0808.3203 (2008) - Florian Hartig, Martin Drechsler:
Stay by thy neighbor? Social organization determines the efficiency of biodiversity markets with spatial incentives. CoRR abs/0808.0111 (2008) - Yulia Kempner, Vadim E. Levit:
Duality between quasi-concave functions and monotone linkage functions. CoRR abs/0808.3244 (2008) - Jian-Guo Liu, Tao Zhou, Bing-Hong Wang, Yi-Cheng Zhang:
Highly accurate recommendation algorithm based on high-order similarities. CoRR abs/0808.3726 (2008) - Daniele De Martino, Luca Dall'Asta, Ginestra Bianconi, Matteo Marsili:
Congestion phenomena on complex networks. CoRR abs/0808.0584 (2008) - Chih-Yuan Tseng, Ariel Caticha:
Using Relative Entropy to Find Optimal Approximations: an Application to Simple Fluids. CoRR abs/0808.4160 (2008) - Ariel Caticha:
Lectures on Probability, Entropy, and Statistical Physics. CoRR abs/0808.0012 (2008) - Gábor Pataki, Mustafa Kemal Tural:
Branching proofs of infeasibility in low density subset sum problems. CoRR abs/0808.0023 (2008) - Vasanthan Raghavan, Jayesh H. Kotecha, Akbar M. Sayeed:
Why Does a Kronecker Model Result in Misleading Capacity Estimates? CoRR abs/0808.0036 (2008) - Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr.:
An Energy-Based Comparison of Long-Hop and Short-Hop Routing in MIMO Networks. CoRR abs/0808.0037 (2008) - Olivier Passalacqua, Eric Benoit, Marc-Philippe Huget, Patrice Moreaux:
Integrating OPC Data into GSN Infrastructures. CoRR abs/0808.0055 (2008) - Emanuel Diamant:
I'm sorry to say, but your understanding of image processing fundamentals is absolutely wrong. CoRR abs/0808.0056 (2008) - Miklos Santha:
Quantum walk based search algorithms. CoRR abs/0808.0059 (2008) - Rui Zhang, Ying-Chang Liang, Chin Choy Chai:
Optimal Beamforming for Two-Way Multi-Antenna Relay Channel with Analogue Network Coding. CoRR abs/0808.0075 (2008) - Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha:
On the hitting times of quantum versus random walks. CoRR abs/0808.0084 (2008) - Edwin A. Henneken, Michael J. Kurtz, Alberto Accomazzi, Carolyn Stern-Grant, Donna M. Thompson, Elizabeth Bohlen, Stephen S. Murray:
Use of Astronomical Literature - A Report on Usage Patterns. CoRR abs/0808.0103 (2008) - Vyacheslav I. Yukalov, Didier Sornette:
Mathematical basis of quantum decision theory. CoRR abs/0808.0112 (2008) - Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. CoRR abs/0808.0148 (2008) - Yair Amir, Paul Bunn, Rafail Ostrovsky:
Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting. CoRR abs/0808.0156 (2008) - Tibor Antal, Daniel ben-Avraham, E. Ben-Naim, Paul L. Krapivsky:
Front Propagation with Rejuvenation in Flipping Processes. CoRR abs/0808.0159 (2008) - Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-Ramanujan Sparsifiers. CoRR abs/0808.0163 (2008) - Yong Gao:
The Degree Distribution of Random k-Trees. CoRR abs/0808.0202 (2008) - K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of Multi-hop Cooperative Networks - Part I: Basic Results. CoRR abs/0808.0234 (2008) - K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks with Full-Duplex Performance. CoRR abs/0808.0235 (2008) - Danilo Gligoroski, Smile Markovski, Svein J. Knapskog:
A Public Key Block Cipher Based on Multivariate Quadratic Quasigroups. CoRR abs/0808.0247 (2008) - Ki-Moon Lee, Hayder Radha:
Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels. CoRR abs/0808.0272 (2008) - Jiri Lebl, Daniel Lichtblau:
Uniqueness of certain polynomials constant on a hyperplane. CoRR abs/0808.0284 (2008)
skipping 198 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-05-13 16:23 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