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 181 matches
- 2007
- Shmuel Onn:
Convex Discrete Optimization. CoRR abs/math/0703575 (2007) - Alfons G. Hoekstra, Simon Portegies Zwart, Marian Bubak, Peter M. A. Sloot:
Towards Distributed Petascale Computing. CoRR abs/astro-ph/0703485 (2007) - L. Fedichkin, Evgeny Katz, Vladimir Privman:
Error Correction and Digitalization Concepts in Biochemical Computing. CoRR abs/cond-mat/0703351 (2007) - Michael D. Coury:
Embedding Graphs into the Extended Grid. CoRR abs/cs/0703001 (2007) - Plamen L. Simeonov:
Integral Biomathics: A Post-Newtonian View into the Logos of Bios (On the New Meaning, Relations and Principles of Life in Science). CoRR abs/cs/0703002 (2007) - Maarten H. van Emden, Belaid Moa, S. C. Somosan:
Functions to Support Input and Output of Intervals. CoRR abs/cs/0703003 (2007) - Francis Heylighen:
Accelerating Socio-Technological Evolution: from ephemeralization and stigmergy to the global brain. CoRR abs/cs/0703004 (2007) - Thomas M. Cover, Young-Han Kim, Arak Sutivong:
Simultaneous Communication of Data and State. CoRR abs/cs/0703005 (2007) - Jing-Chao Chen:
XORSAT: An Efficient Algorithm for the DIMACS 32-bit Parity Problem. CoRR abs/cs/0703006 (2007) - Guillaume Bonfante, Yves Guiraud:
Intensional properties of polygraphs. CoRR abs/cs/0703007 (2007) - Sophie Chatel, Françoise Détienne:
Strategies in object-oriented design. CoRR abs/cs/0703008 (2007) - Warren Sack, Françoise Détienne, Nicolas Ducheneaut, Jean-Marie Burkhardt, Dilan Mahendran, Flore Barcellini:
A Methodological Framework for Socio-Cognitive Analyses of Collaborative Design of Open Source Software. CoRR abs/cs/0703009 (2007) - Jaroslaw Byrka:
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. CoRR abs/cs/0703010 (2007) - Helmut Alt, Maike Buchin:
Can we Compute the Similarity Between Surfaces? CoRR abs/cs/0703011 (2007) - Ramya Ravichandar, James D. Arthur, Manuel A. Pérez-Quiñones:
Pre-Requirement Specification Traceability: Bridging the Complexity Gap through Capabilities. CoRR abs/cs/0703012 (2007) - Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
NLC-2 graph recognition and isomorphism. CoRR abs/cs/0703013 (2007) - Stavros Toumpis:
Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic. CoRR abs/cs/0703014 (2007) - Alex Shkotin:
Graph representation of context-free grammars. CoRR abs/cs/0703015 (2007) - Venkata Sreekanth Annapureddy, Devdutt Marathe, T. R. Ramya, Srikrishna Bhashyam:
Outage Probability of Multiple-Input Single-Output (MISO) Systems with Delayed Feedback. CoRR abs/cs/0703016 (2007) - Sang Joon Kim, Patrick Mitran, Vahid Tarokh:
Performance Bounds for Bi-Directional Coded Cooperation Protocols. CoRR abs/cs/0703017 (2007) - Satoshi Matsuoka:
MLL proof nets as error-correcting codes. CoRR abs/cs/0703018 (2007) - Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. CoRR abs/cs/0703019 (2007) - Anders Hansson, Gabriel Istrate:
Counting preimages of TCP reordering patterns. CoRR abs/cs/0703020 (2007) - Wen-Li Wang, Mei-Huei Tang:
Addressing Components' Evolvement and Execution Behavior to Measure Component-Based Software Reliability. CoRR abs/cs/0703021 (2007) - Dongwoon Bai, Patrick Mitran, Saeed S. Ghassemzadeh, Robert R. Miller, Vahid Tarokh:
Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling. CoRR abs/cs/0703022 (2007) - Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CoRR abs/cs/0703023 (2007) - Marcus Hutter:
Algorithmic Information Theory: a brief non-technical guide to the field. CoRR abs/cs/0703024 (2007) - Jean Charles Gilbert, Xavier Jonsson:
LIBOPT - An environment for testing solvers on heterogeneous collections of problems - Version 1.0. CoRR abs/cs/0703025 (2007) - Marc Daumas, Pascal Giorgi:
Formal proof for delayed finite field arithmetic using floating point operators. CoRR abs/cs/0703026 (2007) - Bernard Jacquemin:
Interroger un corpus par le sens. CoRR abs/cs/0703027 (2007)
skipping 151 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-01-14 18:02 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