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 569 matches
- 2010
- Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek:
Faster p-adic Feasibility for Certain Multivariate Sparse Polynomials. CoRR abs/1010.5310 (2010) - Yohann de Castro:
Optimal designs for Lasso and Dantzig selector using Expander Codes. CoRR abs/1010.2457 (2010) - Francesca Ceragioli, Paolo Frasca:
Continuous-time Discontinuous Equations in Bounded Confidence Opinion Dynamics. CoRR abs/1010.0066 (2010) - L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. CoRR abs/1010.2296 (2010) - Niket K. Choudhary, Rakesh Ginjupalli, Sandeep Navada, Gaurav Khanna:
An Exploration of OpenCL for a Numerical Relativity Application. CoRR abs/1010.3816 (2010) - Shiva Prasad Kasiviswanathan, Cristopher Moore, Louis Theran:
The rigidity transition in random graphs. CoRR abs/1010.3605 (2010) - Claudio De Persis, Rudolf Sailer, Fabian Wirth:
On a small-gain approach to distributed event-triggered control. CoRR abs/1010.6148 (2010) - Laura Poggiolini, Marco Spadini:
Bang-bang trajectories with a double switching time: sufficient strong local optimality conditions. CoRR abs/1010.1149 (2010) - Vladimir Privman:
Control of Noise in Chemical and Biochemical Information Processing. CoRR abs/1010.1853 (2010) - Hina Tabassum, Zaher Dawy, Mohamed-Slim Alouini:
Resource Allocation via Sum-Rate Maximization in the Uplink of Multi-Cell OFDMA Networks. CoRR abs/1010.2692 (2010) - Serdar Yüksel, Sean P. Meyn:
Random-Time, State-Dependent Stochastic Drift for Markov Chains and Application to Stochastic Stabilization Over Erasure Channels. CoRR abs/1010.4820 (2010) - Guofeng Zhang, Matthew R. James:
Direct and Indirect Couplings in Coherent Feedback Control of Linear Quantum Systems. CoRR abs/1010.4369 (2010) - Ming Zhang, Zairong Xi, Jiahua Wei:
Manipulating quantum information on the controllable systems or subspaces. CoRR abs/1010.1622 (2010) - Nam Yul Yu:
Deterministic Compressed Sensing Matrices from Additive Character Sequences. CoRR abs/1010.0011 (2010) - James M. Coughlan, Huiying Shen:
An Embarrassingly Simple Speed-Up of Belief Propagation with Robust Potentials. CoRR abs/1010.0012 (2010) - Mark A. Iwen:
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms. CoRR abs/1010.0014 (2010) - Byung-Gon Chun, Ling Huang, Sangmin Lee, Petros Maniatis, Mayur Naik:
Mantis: Predicting System Performance through Program Analysis and Modeling. CoRR abs/1010.0019 (2010) - Michael M. Zavlanos, Victor M. Preciado, Ali Jadbabaie:
Spectral Control of Mobile Robot Networks. CoRR abs/1010.0034 (2010) - Wesam Gabran, Przemyslaw Pawelczak, Danijela Cabric:
Performance of Multi-Channel Multi-Stage Spectrum Sensing. CoRR abs/1010.0041 (2010) - Mu-rong H. Wu:
A non-cooperative Pareto-efficient solution to a single-shot Prisoner's Dilemma. CoRR abs/1010.0047 (2010) - Cem Tekin, Mingyan Liu:
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach. CoRR abs/1010.0056 (2010) - Hironori Uchikawa, Kenta Kasai, Kohichi Sakaniwa:
Terminated LDPC Convolutional Codes over GF(2p). CoRR abs/1010.0060 (2010) - Michael Hartung, Anika Groß, Erhard Rahm:
Rule-based Generation of Diff Evolution Mappings between Ontology Versions. CoRR abs/1010.0122 (2010) - Mithun Das Gupta, Sanjeev Kumar, Jing Xiao:
L1 Projections with Box Constraints. CoRR abs/1010.0141 (2010) - Jørgen Villadsen, Niklas Skamriis Boss, Andreas Schmidt Jensen, Steen Vester:
Multi-Agent Programming Contest 2010 - The Jason-DTU Team. CoRR abs/1010.0145 (2010) - Andreas Schmidt Jensen:
Implementing Lego Agents Using Jason. CoRR abs/1010.0150 (2010) - Andreas Schmidt Jensen:
An Investigation of the Advantages of Organization-Centered Multi-Agent Systems. CoRR abs/1010.0155 (2010) - Gerald Paul:
Comparative Performance of Tabu Search and Simulated Annealing Heuristics for the Quadratic Assignment Problem. CoRR abs/1010.0157 (2010) - Mohammad Momani, Subhash Challa:
Survey of trust models in different network domains. CoRR abs/1010.0168 (2010) - Massoud Masoumi:
A Novel and Highly Efficient AES Implementation Robust against Differential Power Analysis. CoRR abs/1010.0169 (2010)
skipping 539 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 2025-02-06 21:09 CET 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