|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3642 occurrences of 1964 keywords
|
|
|
Results
Found 5530 publication records. Showing 5530 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
28 | Martin Giese |
A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002, Copenhagen, Denmark, July 30 - August 1, 2002, Proceedings, pp. 130-144, 2002, Springer, 3-540-43929-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Adel Bouhoula |
Simultaneous Checking of Completeness and Ground Confluence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: The Fifteenth IEEE International Conference on Automated Software Engineering, ASE 2000, Grenoble, France, September 11-15, 2000, pp. 143-, 2000, IEEE Computer Society, 0-7695-0710-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Wil Dekkers, Martin W. Bunder, Henk Barendregt |
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 37(5-6), pp. 327-341, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification:03B40 |
28 | Levke Bentzien |
Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 474-482, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Robert Demolombe |
Validity Queries and Completeness Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 9th International Symposium, ISMIS '96, Zakopane, Poland, June 9-13, 1996, Proceedings, pp. 253-263, 1996, Springer, 3-540-61286-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Uncertainty, Epistemic Logic, Intelligent Information Systems |
28 | Helmut Emmelmann |
Testing Completeness of Code Selector Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 4th International Conference on Compiler Construction, CC'92, Paderborn, Germany, October 5-7, 1992, Proceedings, pp. 163-175, 1992, Springer, 3-540-55984-1. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
28 | Steven Klusener |
Completeness in Real Time Process Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings, pp. 376-392, 1991, Springer, 3-540-54430-5. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
& Phrases Real Time, Integration, Process Algebra, SOS, ACP |
28 | Joseph Y. Halpern, John H. Williams, Edward L. Wimmers |
Completeness of Rewrite Rules and Rewrite Strategies for FP ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 37(1), pp. 86-143, January 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
FP |
28 | Hendrik Decker, Lawrence Cavedon |
Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings, pp. 98-115, 1989, Springer, 3-540-52753-2. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
28 | Jieh Hsiang, Michaël Rusinowitch |
A New Method for Establishing Refutational Completeness in Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 141-152, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
28 | Alan J. Demers, James E. Donahue |
"Type-Completeness" as a Language Design Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, USA, January 1980, pp. 234-244, 1980, ACM Press, 0-89791-011-7. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
27 | Dushyanth Narayanan, Austin Donnelly, Richard Mortier, Antony I. T. Rowstron |
Delay aware querying with Seaweed. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 17(2), pp. 315-331, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Dale Miller 0001, Alexis Saurin |
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 405-419, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari |
Building Complete Abstract Interpretations in a Linear Logic-based Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 5th International Symposium, SAS '98, Pisa, Italy, September 14-16, 1998, Proceedings, pp. 215-229, 1998, Springer, 3-540-65014-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Marc H. Graham, Alberto O. Mendelzon, Moshe Y. Vardi |
Notions of dependency satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 33(1), pp. 105-129, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
23 | Sanatan Rai, George L. Vairaktarakis |
NP-complete Problems and Proof Methodology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2675-2682, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Polynomial time reduction, strong NP-completeness, ordinary NP-completeness, Computational complexity, Reducibility, NP-complete problem, NP-hard problem |
23 | Stefan Szeider |
Generalizations of matched CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 223-238, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
matched formula, deficiency, biclique cover, P 2 -completeness, NP-completeness, bipartite graph, polynomial hierarchy, SAT problem |
23 | Sanjeev Arora, Shmuel Safra |
Probabilistic Checking of Proofs: A New Characterization of NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(1), pp. 70-122, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
computations on polynomials and finite fields, proof checking, reducibility and completeness, trade-offs/relations among complexity measures, approximation algorithms, NP-completeness, error-correcting codes, hardness of approximations, probabilistic computation, interactive computation, complexity hierarchies |
23 | Adenilso da Silva Simão, Alexandre Petrenko |
Checking Completeness of Tests for Finite State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 59(8), pp. 1023-1032, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
test analysis, test completeness conditions, test generation, Finite State Machine, fault coverage |
23 | Michele Basaldella, Kazushige Terui |
Infinitary Completeness in Ludics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom, pp. 294-303, 2010, IEEE Computer Society, 978-0-7695-4114-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
ludics, completeness, linear logic, recursive types, coinduction |
23 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Relationless Completeness and Separations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 280-290, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Completeness, Separations, Algebraic complexity |
23 | Sergio España, Nelly Condori-Fernández, Arturo González 0001, Oscar Pastor 0001 |
Evaluating the Completeness and Granularity of Functional Requirements Specifications: A Controlled Experiment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RE ![In: RE 2009, 17th IEEE International Requirements Engineering Conference, Atlanta, Georgia, USA, August 31 - September 4, 2009, pp. 161-170, 2009, IEEE Computer Society, 978-0-7695-3761-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
unity criteria, metrics, requirements engineering, experiment, completeness, use cases, granularity, communication analysis |
23 | Tianyan Deng, Daoyun Xu |
NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, pp. 79-88, 2008, Springer, 978-3-540-69310-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
PCP theorem, linear CNF formula, LSAT, minimal unsatisfiable(MU) formula, NP-completeness, reduction |
23 | Xavier Parent |
On the Strong Completeness of Åqvist's Dyadic Deontic Logic G. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEON ![In: Deontic Logic in Computer Science, 9th International Conference, DEON 2008, Luxembourg, Luxembourg, July 15-18, 2008. Proceedings, pp. 189-202, 2008, Springer, 978-3-540-70524-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Conditional obligation, preference-based semantics, DSDL3, strong completeness |
23 | Luigi Santocanale, Yde Venema |
Completeness for Flat Modal Fixpoint Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings, pp. 499-513, 2007, Springer, 978-3-540-75558-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
fixpoint logic, completeness, modal algebra |
23 | Razvan Cristescu, Baltasar Beferull-Lozano, Martin Vetterli, Roger Wattenhofer |
Network correlated data gathering with explicit communication: NP-completeness and algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 14(1), pp. 41-54, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
conditional coding, correlated data gathering, sensor networks, distributed algorithms, NP-completeness, traveling salesman, routing tree |
23 | Hai Zhuge, Erlin Yao |
Completeness of Query Operations on Resource Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SKG ![In: 2006 International Conference on Semantics, Knowledge and Grid (SKG 2006), 1-3 November 2006, Guilin, China, pp. 3, 2006, IEEE Computer Society, 0-7695-2673-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Resource Space Model, query, completeness, expressiveness, operation, sufficiency |
23 | T. H. Tse, Xin Feng, Tsong Yueh Chen |
On the Completeness of Test Cases for Atomic Arithmetic Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APAQS ![In: 1st Asia-Pacific Conference on Quality Software (APAQS 2000), 30-31 October 2000, Hong Kong, China, Proceedings, pp. 149-155, 2000, IEEE Computer Society, 0-7695-0825-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
completeness of test cases, software testing, mutation testing, mutation operators, Arithmetic expressions |
23 | Yih-Kuen Tsay, Rajive L. Bagrodia |
Deducing Fairness Properties in UNITY Logic - A New Completeness Result. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 17(1), pp. 16-27, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
fairness properties, temporal logic, completeness, UNITY |
23 | Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky |
Reducibility and Completeness in Multi-Party Private Computations ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 478-489, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Oblivious Transfer protocol, multi-party private computations, n-privacy, Boolean functions, completeness, reducibility, black-box, multi-party protocols |
23 | Yoshikane Takahashi |
Fuzzy Database Query Languages and Their Relational Completeness Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 5(1), pp. 122-125, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
fuzzy database query languages, relational completeness theorem, fuzzy calculus query language, fuzzy algebra query language, information retrieval, relational databases, query languages, fuzzy sets, fuzzy set theory, relational calculus, truth values, attribute values |
23 | Lenore Blum, Mike Shub, Steve Smale |
On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 387-397, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
universal machines, partial recursive functions, undecidable sets, foundational issues, NP completeness, numerical analysis, theory of computation, recursive functions, real numbers |
23 | Norihiro Kamide |
Proof Systems Combining Classical and Paraconsistent Negations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 91(2), pp. 217-238, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Paraconsistent negation, completeness, sequent calculus, cut-elimination |
23 | Hugo Herbelin, Gyesik Lee |
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings, pp. 209-217, 2009, Springer, 978-3-642-02260-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Intuitionistic Gentzen-style sequent calculus, completeness, cut-elimination, Kripke semantics |
23 | Theo Härder, Andreas Bühmann |
Value complete, column complete, predicate complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 17(4), pp. 805-826, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cache constraints, Predicate completeness, Query processing, Database caching |
23 | Erez Shalom, Yuval Shahar, Meirav Taieb-Maimon, Guy Bar, Susana B. Martins, Ohad Young, Laszlo T. Vaszar, Yair Liel, Avi Yarkoni, Mary K. Goldstein, Akiva Leibowitz, Tal Marom, Eitan Lunenfeld |
Can Physicians Structure Clinical Guidelines? Experiments with a Mark-Up-Process Methodology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
K4HelP ![In: Knowledge Management for Health Care Procedures, ECAI 2008 Workshop, K4HelP 2008, Patras, Greece, July 21, 2008, Revised Selected Papers, pp. 67-80, 2008, Springer, 978-3-642-03261-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mark-up, Ontologies, Evaluation, Knowledge acquisition, Completeness, Correctness, Clinical guidelines, Clinical decision support systems |
23 | Chih-Wei Lu, Chih-Hung Chang, William C. Chu, Ya-Wen Cheng, Hsin-Chien Chang |
A Requirement Tool to Support Model-Based Requirement Engineering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: Proceedings of the 32nd Annual IEEE International Computer Software and Applications Conference, COMPSAC 2008, 28 July - 1 August 2008, Turku, Finland, pp. 712-717, 2008, IEEE Computer Society, 978-0-7695-3262-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Requirement Editor, Reuse, Consistency, Completeness, Traceability, Maintainability |
23 | Renate A. Schmidt, Ullrich Hustadt |
The axiomatic translation principle for modal logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 8(4), pp. 19, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Translation approach, small model property, completeness, decidability |
23 | Maria Paola Bonacina, Nachum Dershowitz |
Abstract canonical inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 8(1), pp. 6, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
proof orderings, fairness, redundancy, completeness, completion, Inference, saturation, canonicity |
23 | Artiom Matveevici, Yurii Rogozhin, Sergey Verlan |
Insertion-Deletion Systems with One-Sided Contexts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCU ![In: Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings, pp. 205-217, 2007, Springer, 978-3-540-74592-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
insertion-deletion systems, computational non-completeness, universality |
23 | Laurence Cholvy, Stéphanie Roussel 0001 |
Reasoning with an Incomplete Information Exchange Policy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECSQARU ![In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 9th European Conference, ECSQARU 2007, Hammamet, Tunisia, October 31 - November 2, 2007, Proceedings, pp. 683-694, 2007, Springer, 978-3-540-75255-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
information exchange policy, multi-agent system, completeness |
23 | Michael Krüger, Harald Hempel |
Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 243-252, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
coNP-completeness, inverse NP-problems, 3-DIMENSIONAL MATCHING, computational complexity, HAMILTONIAN CYCLE |
23 | Joachim Biskup, Piero A. Bonatti |
Controlled Query Evaluation with Open Queries for a Decidable Relational Submodel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems, 4th International Symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006, Proceedings, pp. 43-62, 2006, Springer, 3-540-31782-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Complete information system, Open query, Safe query, Domain-independent query, Bernays-Schönfinkel class, Completeness test, Relational database, Confidentiality, First-order logic, Finite model theory, Guarded fragment, Lying, Refusal, Implication problem, Controlled query evaluation |
23 | Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman |
Computational challenges in bounded model checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 7(2), pp. 174-183, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Bonded-Model-checking, Completeness-Threshold, Complexity |
23 | Catharine M. Wyss, Edward L. Robertson |
Relational languages for metadata integration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 30(2), pp. 624-660, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
federated data model, metadata querying, relational query algebra, transformational completeness, interoperability, Data integration, schema integration, multidatabases, federated databases, metadata integration |
23 | Bernhard Heinemann |
The Topological Effect of Improving Knowledge Acquisition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2005: Advances in Artificial Intelligence, 4th Mexican International Conference on Artificial Intelligence, Monterrey, Mexico, November 14-18, 2005, Proceedings, pp. 21-30, 2005, Springer, 3-540-29896-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
modal logic and topology, completeness, spatial reasoning, Reasoning about knowledge |
23 | Bernhard Schätz, Christian Salzmann |
Service-Based Systems Engineering: Consistent Combination of Services. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 5th International Conference on Formal Engineering Methods, ICFEM 2003, Singapore, November 5-7, 2003, Proceedings, pp. 86-104, 2003, Springer, 3-540-20461-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
model checking, interaction, specification, component, application, consistency, implementation, Service, completeness, tool- support, behavior, formalization, partiality |
23 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara |
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 106-118, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Chordal bipartite graph, Interval bigraph, Probe interval graph, Tree spanner, NP-completeness |
23 | Roberto Giacobazzi, Isabella Mastroeni |
Domain Compression for Complete Abstractions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 4th International Conference, VMCAI 2003, New York, NY, USA, January 9-11, 2002, Proceedings, pp. 146-160, 2003, Springer, 3-540-00348-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
domain refinement, abstract model-checking, program analysis, Abstract interpretation, completeness, predicate abstraction, abstract domains |
23 | Andrea Frosini, Giulia Simi |
The Reconstruction of a Bicolored Domino Tiling from Two Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 10th International Conference, DGCI 2002, Bordeaux, France, April 3-5, 2002, Proceedings, pp. 136-144, 2002, Springer, 3-540-43380-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Domino tiling, Reconstruction Problem, NP-completeness |
23 | Alfredo Burrieza, Inman P. de Guzmán |
A Temporal × Modal Approach to the Definability of Properties of Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 4th International Workshop, FroCoS 2002, Santa Margherita Ligure, Italy, April 8-10, 2002, Proceedings, pp. 239-254, 2002, Springer, 3-540-43381-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
$Ttimes W$-semantics, functional semantics, completeness, definability |
23 | Jeroen Voeten |
On the fundamental limitations of transformational design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 6(4), pp. 533-552, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
syntactic variance problem, formal methods, high-level synthesis, Completeness, transformational design |
23 | Hong Zhu 0002, Lingzi Jin |
Scenario Analysis in an Automated Tool for Requirements Engineering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Requir. Eng. ![In: Requir. Eng. 5(1), pp. 2-22, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Requirements model synthesis, Requirements engineering, Consistency, Completeness, Scenario analysis, Automated tool |
23 | Joachim Biskup, David W. Embley |
Mediated Information Gain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: 2000 International Database Engineering and Applications Symposium, IDEAS 2000, September 18-20, 2000, Yokohoma, Japan, Proccedings, pp. 360-370, 2000, IEEE Computer Society, 0-7695-0789-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
mediated information gain, human burden, algorithmically tractable subtasks, quality level, mediation task, formal information state, returned answer, internal consistency maintenance, relevant source parts, searching, information systems, implementation, embeddings, querying, completeness, rules, correctness, user interactions, updating, sensor fusion, high-level architecture, iteration, schema, precision, revisions, heterogeneous data sources, instance, query specifications |
23 | David von Oheimb |
Hoare Logic for Mutual Recursion and Local Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings, pp. 168-180, 1999, Springer, 3-540-66836-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
axiomaticsemantics, relative completeness, local variables, call-by-value parameters, soundness, Hoare logic, Isabelle/HOL, mutual recursion |
23 | Franz-Josef Brandenburg |
On the Complexity of Optimal Drawings of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings, pp. 166-180, 1989, Springer, 3-540-52292-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
placement graph grammars, NP-completeness, embeddings, graph grammars, graph layout |
22 | Ouidad Akhrif, Chaymae Benfares, Mostapha E. L. Jai, Younès El Bouzekri El Idrissi, Nabil Hmina |
Completeness based classification algorithm: a novel approach for educational semantic data completeness assessment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Interact. Technol. Smart Educ. ![In: Interact. Technol. Smart Educ. 19(1), pp. 87-111, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Fariz Darari, Werner Nutt, Simon Razniewski, Sebastian Rudolph |
Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Semantic Web ![In: Semantic Web 11(3), pp. 441-482, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Luis Valencia-Cabrera, David Orellana-Martín, Miguel Ángel Martínez-del-Amor, Ignacio Pérez-Hurtado, Mario J. Pérez-Jiménez |
From NP-Completeness to DP-Completeness: A Membrane Computing Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex. ![In: Complex. 2020, pp. 6765097:1-6765097:10, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Yuta Higuchi, Kei Kimura |
NP-Completeness of Fill-a-Pix and ΣP2-Completeness of Its Fewest Clues Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(11), pp. 1490-1496, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Rachid Mecheraoui, Aiman Mukheimer, Stojan Radenovic |
From G-Completeness to M-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 11(7), pp. 839, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Wei Li, Hongliang Lai, Dexue Zhang |
Yoneda completeness and flat completeness of ordered fuzzy sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 313, pp. 1-24, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Miguel Campercholi, Michal M. Stronkowski, Diego Vaggione |
On structural completeness versus almost structural completeness problem: A discriminator varieties case study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 23(2), pp. 235-246, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Dmitriy Bui, Anna Puzikova |
Axiomatics for Multivalued Dependencies in Table Databases: Correctness, Completeness, Completeness Criteria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DepCoS-RELCOMEX ![In: Theory and Engineering of Complex Systems and Dependability - Proceedings of the Tenth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, June 29 - July 3 2015, Brunów, Poland, pp. 45-55, 2015, Springer, 978-3-319-19215-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan |
Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR14, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
22 | Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan |
Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, pp. 445-456, 2014, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-77-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Lei Chen 0007, Weiming Zeng, Changhong Lu |
NP-completeness and APX-completeness of restrained domination in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 448, pp. 1-8, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 339(2-3), pp. 272-292, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Tadeusz Litak |
On Notions of Completeness Weaker than Kripke Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 5, papers from the fifth conference on `Advances in Modal logic,` held in Manchester, UK, 9-11 September 2004, pp. 149-169, 2004, King's College Publications, 1-904987-22-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
22 | Beate Bollig, Ingo Wegener |
Completeness and Non-Completeness Results with Respect to Read-Once Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 143(1), pp. 24-33, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
22 | David W. Juedes, Jack H. Lutz |
Completeness and Weak Completeness Under Polynomial-Size Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 125(1), pp. 13-31, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
22 | Rodney G. Downey, Michael R. Fellows |
Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 141(1&2), pp. 109-131, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
22 | Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows |
Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 73(3), pp. 235-276, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
22 | David W. Juedes, Jack H. Lutz |
Completeness and Weak Completeness Under Polynomial-Size Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 26-37, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
22 | Dan A. Simovici, Ivan Stojmenovic, Ratko Tosic |
Functional Completeness and Weak Completeness in Set Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 23rd IEEE International Symposium on Multiple-Valued Logic, ISMVL 1993, Sacramento, California, USA, May 24-27, 1993, Proceedings, pp. 251-256, 1993, IEEE Computer Society, 0-8186-3350-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
22 | Azeddine Lazrek, Pierre Lescanne, Jean-Jacques Thiel |
Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 84(1), pp. 47-70, January 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
22 | Michal Grabowski |
Arithmetical completeness versus relative completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 47(3), pp. 213-220, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
22 | Maria Manuel Clementino, Dirk Hofmann |
Lawvere Completeness in Topology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 17(2), pp. 175-210, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 18A05, 18D15, 18D20, 18B35, 54E15, 54E50, 18C15 |
22 | Thomas Ågotnes, Wiebe van der Hoek, Juan A. Rodríguez-Aguilar, Carles Sierra, Michael J. Wooldridge |
Multi-Modal CTL: Completeness, Complexity, and an Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 92(1), pp. 1-26, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Computation Tree Logic (ctl), Social Laws, Normative Systems |
22 | Gianluca Amato, Francesca Scozzari |
Observational Completeness on Abstract Interpretation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings, pp. 99-112, 2009, Springer, 978-3-642-02260-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Victor Chen |
A Hypergraph Dictatorship Test with Perfect Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 448-461, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Gowers norm, Property testing, Fourier analysis, PCP |
22 | Tran Cao Son, Enrico Pontelli |
Some Results on the Completeness of Approximation Based Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence, Hanoi, Vietnam, December 15-19, 2008. Proceedings, pp. 358-369, 2008, Springer, 978-3-540-89196-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | David S. Johnson |
The NP-completeness column: Finding needles in haystacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(2), pp. 24, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
PPAD, game theory, local search, Nash equilibrium, fixed point, PLS |
22 | Shaoying Liu |
Utilizing Test Case Generation to Inspect Formal Specifications for Completeness and Feasibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HASE ![In: Tenth IEEE International Symposium on High Assurance Systems Engineering (HASE 2007), November 14-16, 2007, Dallas, Texas, USA, pp. 349-356, 2007, IEEE Computer Society, 0-7695-3043-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Yang Xu 0001, Shuwei Chen 0001, Jun Liu 0001, Da Ruan 0001 |
Weak Completeness of Resolution in a Linguistic Truth-Valued Propositional Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFSA (2) ![In: Theoretical Advances and Applications of Fuzzy Logic and Soft Computing, Selection of Papers from IFSA 2007, pp. 358-366, 2007, Springer, 978-3-540-72433-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Mitsuhiro Okada, Ryo Takemura |
Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rewriting, Computation and Proof ![In: Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, pp. 167-181, 2007, Springer, 978-3-540-73146-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Martijn Warnier, Frances M. T. Brazier, Martin Apistola, Anja Oskamp |
Towards automatic identification of completeness and consistency in digital dossiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAIL ![In: The Eleventh International Conference on Artificial Intelligence and Law, Proceedings of the Conference, June 4-8, 2007, Stanford Law School, Stanford, California, USA, pp. 177-181, 2007, ACM, 978-1-59593-680-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | John Fisher, Marc Bezem |
Query Completeness of Skolem Machine Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCU ![In: Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings, pp. 182-192, 2007, Springer, 978-3-540-74592-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Aniket Mahanti, Martin F. Arlitt, Carey L. Williamson |
Assessing the Completeness of Wireless-side Tracing Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WOWMOM ![In: 2007 International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM 2007), 18-21 June 2007, Helsinki, Finland, Proceedings, pp. 1-10, 2007, IEEE Computer Society, 1-4244-0992-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | David S. Johnson |
The NP-completeness column: The many limits on approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(3), pp. 473-489, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
label cover, Approximation algorithms, lower bounds, set cover, clique, probabilistically checkable proofs, Unique Games Conjecture |
22 | Richard Bonichon, Olivier Hermant |
A Semantic Completeness Proof for TaMeD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 167-181, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Günter Kniesel, Uwe Bardey |
An Analysis of the Correctness and Completeness of Aspect Weaving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCRE ![In: 13th Working Conference on Reverse Engineering (WCRE 2006), 23-27 October 2006, Benevento, Italy, pp. 324-333, 2006, IEEE Computer Society, 0-7695-2719-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Gang Gou, Maxim Kormilitsin, Rada Chirkova |
Query evaluation using overlapping views: completeness and efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 27-29, 2006, pp. 37-48, 2006, ACM, 1-59593-256-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rewriting queries using views, query optimization, materialized views |
22 | Joe Hendrix, José Meseguer 0001, Hitoshi Ohsaki |
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 151-155, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Hervé Fournier, Guillaume Malod |
Universal Relations and #P-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 368-379, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello |
Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCPC ![In: Languages and Compilers for Parallel Computing, 19th International Workshop, LCPC 2006, New Orleans, LA, USA, November 2-4, 2006. Revised Papers, pp. 283-298, 2006, Springer, 978-3-540-72520-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | David McSherry |
Completeness Criteria for Retrieval in Recommender Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCBR ![In: Advances in Case-Based Reasoning, 8th European Conference, ECCBR 2006, Fethiye, Turkey, September 4-7, 2006, Proceedings, pp. 9-29, 2006, Springer, 3-540-36843-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Subhash Khot, Rishi Saket |
A 3-Query Non-Adaptive PCP with Perfect Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic, pp. 159-169, 2006, IEEE Computer Society, 0-7695-2596-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Jingling Xue, Phung Hua Nguyen |
Completeness Analysis for Incomplete Object-Oriented Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 14th International Conference, CC 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 271-286, 2005, Springer, 3-540-25411-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Pawel Waszkiewicz |
Completeness and Compactness of Quantitative Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 341-351, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 5530 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|