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 170 matches
- 2006
- Dorit Aharonov, Itai Arad:
The BQP-hardness of approximating the Jones Polynomial. CoRR abs/quant-ph/0605181 (2006) - Jonathan Barrett, Adrian Kent, Stefano Pironio:
Maximally Non-Local and Monogamous Quantum Correlations. CoRR abs/quant-ph/0605182 (2006) - Yael Berstein, Shmuel Onn:
Nonlinear Bipartite Matching. CoRR abs/math/0605610 (2006) - Subhash C. Kak:
Quantum Information and Entropy. CoRR abs/quant-ph/0605096 (2006) - Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
N-Fold Integer Programming. CoRR abs/math/0605242 (2006) - Alexander Yu. Vlasov:
Classical simulators of quantum computers and no-go theorems. CoRR abs/quant-ph/0605219 (2006) - Juan Carlos Cuevas-Tello, Peter Tiño, Somak Raychaudhury:
How accurate are the time delay estimates in gravitational lensing? CoRR abs/astro-ph/0605042 (2006) - Lukasz Bratek, Marcin Kolonko:
An algorithm for solving the pulsar equation. CoRR abs/astro-ph/0605514 (2006) - Martin Weigt, Haijun Zhou:
Message passing for vertex covers. CoRR abs/cond-mat/0605190 (2006) - William Thistleton, John A. Marsh, Kenric P. Nelson, Constantino Tsallis:
Generalized Box-Muller method for generating q-Gaussian random deviates. CoRR abs/cond-mat/0605570 (2006) - Chao Tian, Suhas N. Diggavi:
On Multistage Successive Refinement for Wyner-Ziv Source Coding with Degraded Side Informations. CoRR abs/cs/0605001 (2006) - Chao-Yang Pang, Zheng-Wei Zhou, Guang-Can Guo:
A Hybrid Quantum Encoding Algorithm of Vector Quantization for Image Compression. CoRR abs/cs/0605002 (2006) - Amitabh Saxena, Ben Soh:
A New Cryptosystem Based On Hidden Order Groups. CoRR abs/cs/0605003 (2006) - Himanshu Thapliyal, M. B. Srinivas:
Novel Reversible Multiplier Architecture Using Reversible TSG Gate. CoRR abs/cs/0605004 (2006) - Ruoheng Liu, Ivana Maric, Roy D. Yates, Predrag Spasojevic:
The Discrete Memoryless Multiple Access Channel with Confidential Messages. CoRR abs/cs/0605005 (2006) - Shengtian Yang, Peiliang Qiu:
An Information-Spectrum Approach to Multiterminal Rate-Distortion Theory. CoRR abs/cs/0605006 (2006) - Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall, Amin Vahdat:
Systematic Topology Analysis and Generation Using Degree Correlations. CoRR abs/cs/0605007 (2006) - Arnaud Durand, Etienne Grandjean:
The complexity of acyclic conjunctive queries revisited. CoRR abs/cs/0605008 (2006) - Marcus Hutter:
On the Foundations of Universal Sequence Prediction. CoRR abs/cs/0605009 (2006) - Di Wu, Predrag Spasojevic:
Complementary Set Matrices Satisfying a Column Correlation Constraint. CoRR abs/cs/0605010 (2006) - Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-Trees. CoRR abs/cs/0605011 (2006) - Luc Steels, Martin Loetzsch:
Perspective alignment in spatial language. CoRR abs/cs/0605012 (2006) - L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Geometric representation of graphs in low dimension. CoRR abs/cs/0605013 (2006) - Yingbin Liang, H. Vincent Poor:
Generalized Multiple Access Channels with Confidential Messages. CoRR abs/cs/0605014 (2006) - Ciro Cattuto, Vittorio Loreto, Luciano Pietronero:
Collaborative Tagging and Semiotic Dynamics. CoRR abs/cs/0605015 (2006) - Yingbin Liang, Venugopal V. Veeravalli:
Cooperative Relay Broadcast Channels. CoRR abs/cs/0605016 (2006) - Phan Huy Tu, Tran Cao Son, Chitta Baral:
Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming. CoRR abs/cs/0605017 (2006) - Florentin Smarandache, Sukanto Bhattacharya, Mohammad Khoshnevisan, Housila P. Singh, Rajesh Singh, F. Kaymram, S. Malakar, Jose L. Salmeron:
Computational Modeling in Applied Problems: collected papers on econometrics, operations research, game theory and simulation. CoRR abs/cs/0605018 (2006) - Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok:
The Distribution of Patterns in Random Trees. CoRR abs/cs/0605019 (2006) - Sergey Alpaev:
Applied MVC Patterns. A pattern language. CoRR abs/cs/0605020 (2006)
skipping 140 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-09-20 10:31 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