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 25 matches
- 2024
- Manuel Weber, Farzan Banihashemi, Davor Stjelja, Peter Mandl, Ruben Mayer, Hans-Arno Jacobsen:
Coddora: CO2-Based Occupancy Detection Model Trained via Domain Randomization. IJCNN 2024: 1-8 - Vincent Y. Wang, Ravi Prakash, Siobhan Rigby Oca, Ethan J. LoCicero, Patrick J. Codd, Leila Jasmine Bridgeman:
Sampling-Based Model Predictive Control for Volumetric Ablation in Robotic Laser Surgery. CoRR abs/2410.03152 (2024) - 2023
- Xiaodan Yin, Xiaorui Wang, Yuquan Li, Jike Wang, Yuwei Wang, Yafeng Deng, Tingjun Hou, Huanxiang Liu, Pei Luo, Xiaojun Yao:
CODD-Pred: A Web Server for Efficient Target Identification and Bioactivity Prediction of Small Molecules. J. Chem. Inf. Model. 63(20): 6169-6176 (2023) - 2018
- Aizhong Li:
A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd. CoRR abs/1809.04519 (2018) - 2013
- Rafal Kozik:
A Simplified Visual Cortex Model for Efficient Image Codding and Object Recognition. IP&C 2013: 271-278 - 2011
- Radim Belohlávek, Vilém Vychodil:
Codd's Relational Model from the Point of View of Fuzzy Logic. J. Log. Comput. 21(5): 851-862 (2011) - 2009
- Peter M. Kelly, Paul D. Coddington, Andrew L. Wendelborn:
Lambda calculus as a workflow model. Concurr. Comput. Pract. Exp. 21(16): 1999-2017 (2009) - 2008
- Peter M. Kelly, Paul D. Coddington, Andrew L. Wendelborn:
Lambda Calculus as a Workflow Model. GPC Workshops 2008: 15-22 - Radim Belohlávek, Vilém Vychodil:
Data Dependencies in Codd's Relational Model with Similarities. Handbook of Research on Fuzzy Information Processing in Databases 2008: 634-657 - 2006
- Radim Belohlávek, Vilém Vychodil:
Codd's Relational Model of Data and Fuzzy Logic: Comparisons, Observations, and Some New Results. CIMCA/IAWTIC 2006: 70 - 2005
- Duncan A. Grove, Paul D. Coddington:
Modeling message-passing programs with a Performance Evaluating Virtual Parallel Machine. Perform. Evaluation 60(1-4): 165-187 (2005) - Duncan A. Grove, Paul D. Coddington:
Communication Benchmarking and Performance Modelling of MPI Programs on Cluster Computers. J. Supercomput. 34(2): 201-217 (2005) - Duncan A. Grove, Paul D. Coddington:
Analytical Models of Probability Distributions for MPI Point-to-Point Communication Times on Distributed Memory Parallel Computers. ICA3PP 2005: 406-415 - 2004
- Duncan A. Grove, Paul D. Coddington:
Communication Benchmarking and Performance Modelling of MPI Programs on Cluster Computers. IPDPS 2004 - 2002
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks (Reprint). Software Pioneers 2002: 263-294 - 1991
- Clive F. Baillie, Paul D. Coddington:
Cluster Identification Algorithms for Spin Models - Sequential and Parallel. Concurr. Pract. Exp. 3(2): 129-144 (1991) - 1990
- E. F. Codd:
The Relational Model for Database Management, Version 2. Addison-Wesley 1990, ISBN 0-201-14192-2 - 1988
- E. F. Codd:
'Universal' Relation Fails to Replace Relational Model (letter to the editor). IEEE Softw. 5(4): 4-6 (1988) - 1983
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks (Reprint). Commun. ACM 26(1): 64-69 (1983) - 1980
- E. F. Codd:
Data Models in Database Management. Workshop on Data Abstraction, Databases and Conceptual Modelling 1980: 112-114 - Stephen N. Zilles, Ira P. Goldstein, E. F. Codd, Mary Shaw:
Workshop Summary (discussion). Workshop on Data Abstraction, Databases and Conceptual Modelling 1980: 88-90 - 1979
- E. F. Codd:
Extending the Database Relational Model to Capture More Meaning. ACM Trans. Database Syst. 4(4): 397-434 (1979) - E. F. Codd:
Extending the Data Base Relational Model to Capture More Meaning (Abstract). SIGMOD Conference 1979: 161 - 1971
- E. F. Codd:
Further Normalization of the Data Base Relational Model. Research Report / RJ / IBM / San Jose, California RJ909 (1971) - 1970
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387 (1970)
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-11-20 11:33 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