Search results for "DP-complete"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
11	Wei Sun 0002, Clement T. Yu	Semantic Query Optimization for Tree and Chain Queries.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	chain queries, knowledge-based query optimization, semantically equivalent transformations, unnecessary joins, redundant beneficial/nonbeneficial selection operations, acyclic queries, closure chain queries, equi-join attributes, restriction closure computation, computational complexity, query processing, knowledge based systems, NP complete, time complexity, database theory, trees (mathematics), semantic query optimization, query graphs, tree queries
11	Philippe Mathieu, Jean-Paul Delahaye	A Kind of Achievement by Parts Method.	LPAR	1994	DBLP DOI BibTeX RDF	Topics Logic of Knowledge, Complete computation, Deduction
11	R. Ravi 0001	Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract)	FOCS	1994	DBLP DOI BibTeX RDF	minimum gossip time problem, rapid rumor ramification, minimum broadcast time approximation, minimum broadcast time problem, telephone model, multicast problem, NP-complete, NP-hard, undirected graph, conference calls
11	Silvio Micali	CS Proofs (Extended Abstracts)	FOCS	1994	DBLP DOI BibTeX RDF	computationally sound proof, CS proofs, computationally-based notion, cryptographic assumption, computational complexity, NP complete problem, polynomial time, proof, random oracle
11	Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae	Availability of k-Coterie.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	distributed k-mutual-exclusion problem, k-mutex problem, distribution system, graph theory, distributed processing, concurrency control, network topology, critical section, complete graph
11	Shirish Bhide, Nigel M. John, Mansur R. Kabuka	A Boolean Neural Network Approach for the Traveling Salesman Problem.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	Boolean neural network, simulation, scheduling, real-time systems, real-time systems, computational complexity, simulated annealing, combinatorial optimization, Boolean functions, traveling salesman problem, neural nets, job scheduling, NP-complete problems, noise immunity, hardware complexity, simulated annealing algorithm
11	Nageswara S. V. Rao	Computational Complexity Issues in Operative Diagnosis of Graph-Based Systems.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	graph-based systems, alarm placement, fault propagation time, alarm placement problem, computational complexity, computational complexity, fault diagnosis, fault tolerant computing, NP-complete, fault propagation
11	Vijay Raghavan 0002	On Asymmetric Invalidation with Partial Tests.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	asymmetric invalidation, partial tests, diagnosability problem, co-NP complete, computational complexity, fault diagnosis, logic testing, diagnosis algorithm
11	Gilles Brassard, Claude Crépeau, Richard Jozsa, Denis Langlois	A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties	FOCS	1993	DBLP DOI BibTeX RDF	circular polarization, quantum bit commitment scheme, complete protocol, polarized photons, conjugate transmission-reception basis
11	David W. Juedes, Jack H. Lutz	The Complexity and Distribution of Hard Problems (Extended Abstract)	FOCS	1993	DBLP DOI BibTeX RDF	complete languages, hard problems, time complexity classes, hard languages, complexity, distribution, reducibility
11	Stavros S. Cosmadakis	Logical Reducibility and Monadic NP	FOCS	1993	DBLP DOI BibTeX RDF	syntactically restricted first-order reductions, logical reducibility, monadic NP, polynomial-time many-one reductions, directed reachability, encodings, first-order logic, NP-complete problems, relational structures
11	Richa Agarwala, David Fernández-Baca	A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed	FOCS	1993	DBLP DOI BibTeX RDF	perfect phylogeny problem, character states, NP-complete, polynomial-time algorithm
11	Majid Sarrafzadeh, C. K. Wong	Bottleneck Steiner Trees in the Plane.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	bottleneck Steiner trees, maximum-weight edge minimized, linear decision tree model, communication network design, computational complexity, lower bound, optimisation, NP-complete, trees (mathematics), VLSI layout, location problems
11	Cheol-Hoon Lee, Dongmyun Lee, Myunghwan Kim 0001	Optimal Task Assignment in Linear Array Networks.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	optimal task assignment, linear array networks, network flow approach, two-terminal network flow problem, computational complexity, distributed processing, NP-complete, computer networks, communication costs, task assignment, distributed computing system
11	Krishna P. Belkhale, Prithviraj Banerjee	Reconfiguration Strategies for VLSI Processor Arrays and Trees Using a Modified Diogenes Approach.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	reconfiguration strategies, VLSI processor arrays, Diogenes approach, rectangular arrays, VLSI, fault tolerant computing, trees, trees (mathematics), circuit layout CAD, complete binary tree
11	Kostas N. Oikonomou	Abstractions of Finite-State Machines and Immediately-Detectable Output Faults.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	immediately-detectable output faults, nondeterministic machine, approximately optimal partition, computational complexity, data structures, fault tolerant computing, abstraction, NP-complete, finite-state machines, polynomial-time algorithm, finite automata, set partitioning
11	Rajeev Alur, Thomas A. Henzinger	Back to the Future: Towards a Theory of Timed Regular Languages	FOCS	1992	DBLP DOI BibTeX RDF	theory of timed regular languages, two-way timed automata, temporal logic, undecidability, boolean operations, PSPACE-complete
11	Bernd Becker 0001	Synthesis for Testability: Binary Decision Diagrams.	STACS	1992	DBLP DOI BibTeX RDF	VLSI structures, (complete, full) testability, synthesis, fault model, algorithms and data structures
11	Abdol-Hossein Esfahanian, Lionel M. Ni, Bruce E. Sagan	The Twisted N-Cube with Application to Multiprocessing.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	twisted N-cube, n-regular graphs, graph theory, connectivity, hypercube networks, trees (mathematics), multiprocessing, disjoints paths, hypercube multiprocessors, complete binary tree, subgraph
11	Chung-Kuan Cheng, So-Zen Yao, T. C. Hu	The Orientation of Modules Based on Graph Decomposition.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	layout stage, total net length, printed circuits, computational complexity, VLSI, VLSI, graph theory, NP-complete, modules, orientation, circuit layout CAD, routability, minimum cut, graph decomposition, printed circuit board, graph problem
11	O. J. Murphy, R. L. McCraw	Designing Storage Efficient Decision Trees.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	storage efficient decision trees, storage optimal decision tree, information-theoretic heuristic, computational complexity, computational complexity, data structures, trees (mathematics), decision theory, NP-complete problem, decision tables, decision tables
11	Tzong-An Su, Gultekin Özsoyoglu	Controlling FD and MVD Inferences in Multilevel Relational Database Systems.	IEEE Trans. Knowl. Data Eng.	1991	DBLP DOI BibTeX RDF	FD inferences, attribute classification, MVD inferences, multilevel relational database, record classification, FD-compromises, minimum information loss, MVD-compromises, conflict-free MVDs, computational complexity, relational databases, database theory, inference mechanisms, functional dependencies, NP-complete problem, exact algorithm, necessary and sufficient conditions, multivalued dependencies
11	Dennis E. Shasha, Jason Tsong-Li Wang	Optimizing Equijoin Queries In Distributed Databases Where Relations Are Hash Partitioned.	ACM Trans. Database Syst.	1991	DBLP DOI BibTeX RDF	equijoin, systems, spanning trees, hashing, NP-complete problems, relational data models
11	David Baraff	Coping with friction for non-penetrating rigid body simulation.	SIGGRAPH	1991	DBLP DOI BibTeX RDF	NP-complete, dynamics, friction
11	Martin L. Brady, Majid Sarrafzadeh	Stretching a Knock-Knee Layout for Multilayer Wiring.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	knock-knee layout stretching, multilayer wiring, knock-knee mode, 4/3 approximation algorithm, VLSI, VLSI, NP-complete, optimal algorithm, circuit layout CAD
11	O. Deux	The Story of O2.	IEEE Trans. Knowl. Data Eng.	1990	DBLP DOI BibTeX RDF	O/sub 2/, disk management, overriding, user interface generation tools, complete programming environment, multilanguage paradigm, dual mode, workstation/server configuration, prototype performance, object-oriented programming, programming environment, DBMS, database management systems, query language, query languages, completeness, inheritance, typing, extensibility, sharing, persistence, encapsulation, complex objects, object-oriented database system, object identity
11	László Babai, Lance Fortnow, Carsten Lund	Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols	FOCS	1990	DBLP DOI BibTeX RDF	efficient provability, multiple prover interactive proof systems, two-prover interactive protocols, noncommunicating provers, randomizing polynomial-time verifier, coNP-complete languages, nondeterministic exponential time, polynomial time
11	Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar	Decision Problems for Propositional Linear Logic	FOCS	1990	DBLP DOI BibTeX RDF	noncommutative propositional linear logic, propositional linear logic, multiplicative fragment, unrestricted weakening, NP-completeness, undecidability, decision problem, PSPACE-complete
11	Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann 0001, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger	Drawing Graphs in the Plane with High Resolution	FOCS	1990	DBLP DOI BibTeX RDF	high resolution planar graph drawing, straight line edges, minimum angle, incident edges, maximum node degree, hypercubes, NP-hard problem, counting, complete graphs, tori, multidimensional meshes
11	Xiaotie Deng, Christos H. Papadimitriou	Exploring an Unknown Graph (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	unknown graph exploration, strongly connected graph, Eulerian graphs, bounded ratio, directed graph, PSPACE-complete, worst-case ratio
11	K. V. S. Ramarao	Distributed Algorithms for Network Recognition Problems.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	unified algorithms, network recognition, noncentralized initiations, computational complexity, distributed algorithms, distributed processing, computer networks, tree, time complexities, communication complexity, bipartite graph, ring, centralized, decentralized, star, complete graph
11	Rajiv M. Dewan, Bezalel Gavish	Models for the Combined Logical and Physical Design of Databases.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	integrated formulation, model, databases, NP-complete, database management systems, transactions, decomposition, database theory, database theory, physical design, mathematical program, combined logical
11	Alan A. Bertossi, Maurizio A. Bonuccelli	A Gracefully Degradable VLSI System for Linear Programming.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	gracefully degradable, fault-tolerant VLSI system, linear programming problems, interconnection pattern, cousin nodes, ternary tree, faulty processing elements, computational complexity, VLSI, fault tolerant computing, linear programming, multiple faults, complete binary tree, simplex algorithm
11	Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis	The Parallel Complexity of the Subgraph Connectivity Problem	FOCS	1989	DBLP DOI BibTeX RDF	triconnected components, subgraph connectivity problem, induced subgraph, cardinality, parallel complexity, P-complete
11	Cheng Ng	Lower Bounds for the Stable Marriage Problem and its Variants	FOCS	1989	DBLP DOI BibTeX RDF	men, opposite sex, order of preference, complete matching, lower bound, ranks, women, worst case, stable marriage problem, partners
11	Odile Marcotte, Subhash Suri	Fast Matching Algorithms for Points on a Polygon (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	Ackermann function, endpoints, minimum-weight perfect matching, verification problem, nonconvex polygons, functional inverse, weights, edges, boundary, assignment problem, Euclidean distance, convex polygon, simple, complete graph, nonconvex
11	Yuejun Jiang	An Autoepistemic Logical View of Knowledge Base.	FSTTCS	1989	DBLP DOI BibTeX RDF	AI in Database, Incomplete knowledge, Complete Database, Nonstandard Logic, Modal logic, Deductive database, Integrity Constraints, Non-monotonic logic, Closed World Assumption, Possible worlds semantics, Autoepistemic logic
11	Elias Dahlhaus, Péter Hajnal, Marek Karpinski	Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs	FOCS	1988	DBLP DOI BibTeX RDF	Hamiltonian cycle problem, dense graphs, concurrent-read-exclusive-write parallel random-access machine, graph, NP-complete, perfect matching, vertex, optimal parallel algorithm, polylogarithmic factor
11	Olivier Goldschmidt, Dorit S. Hochbaum	Polynomial Algorithm for the k-Cut Problem	FOCS	1988	DBLP DOI BibTeX RDF	k-cut problem, edge weighted graph, k nonempty components, total edge weight, partition, NP-complete, NP hard, polynomial algorithm, vertex
11	Hans L. Bodlaender	Dynamic Programming on Graphs with Bounded Treewidth.	ICALP	1988	DBLP DOI BibTeX RDF	graph decision problems, restrictions of NP-complete problems, local condition compositions, dynamic programming, polynomial time algorithms, Treewidth, partial k-trees
11	Hans L. Bodlaender	Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees.	SWAT	1988	DBLP DOI BibTeX RDF	Chromatic Index, graphs with small treewidth, polynomial time algorithms, NP-complete problems, Graph Isomorphism, tree-decompositions, partial k-trees
11	Ryosaku Shimada, Yoshiteru Ohkura, Jun-ichi Aoe	Nonbinary Arithmetic AN Codes Using Odd Radix Expressions.	IEEE Trans. Computers	1985	DBLP DOI BibTeX RDF	symmetric R-ary expressions, Absolute-minimum complete residue system, arithmetic AN codes, arithmetic error, cyclic SR -AN codes, Lee-type arithmetic distance
11	Hisao Kameda	Optimality of a Central Processor Scheduling Policy for Processing a Job Stream	ACM Trans. Comput. Syst.	1984	DBLP DOI BibTeX RDF	1/0 bound, CPU bound, Markovian queuing model, dispatching policy, finite-source queue, job stream, machine repairman model, multiple-resource system, near-complete decomposability, multiprogramming, CPU scheduling, preemptive priority
11	Inder S. Gopal, Don Coppersmith, C. K. Wong	Optimal Wiring of Movable Terminals.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	wiring channels, movable terminals, VLSI chip design, dynamic programming, optimal algorithms, Analysis of algorithms, NP-complete problems, wiring, vias
11	Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida	On Minimal Test Sets for Locating Single Link Failures in Networks.	IEEE Trans. Computers	1981	DBLP DOI BibTeX RDF	network diagnosis, system graph, Algorithm, complexity, test, NP-complete, tree, diagnosis
11	Gururaj S. Rao, Harold S. Stone, T. C. Hu	Assignment of Task in a Distributed Processor System with Limited Memory.	IEEE Trans. Computers	1979	DBLP DOI BibTeX RDF	Ford?Fulkerson algorithm, Gomory?Hu cut trees, multiterminal maximal flows, load balancing, distributed computers, Computer networks, NP-complete problems, cutsets
11	Joseph Y.-T. Leung, Edmund K. Lai	On Minimum Cost Recovery from System Deadlock.	IEEE Trans. Computers	1979	DBLP DOI BibTeX RDF	average-case performance, minimum cost deadlock recovery, system deadlock, Approximation algorithms, time complexity, NP-complete problems, worst case performance
11	John B. Kam, George I. Davida	Structured Design of Substitution-Permutation Encryption Networks.	IEEE Trans. Computers	1979	DBLP DOI BibTeX RDF	substitution-permutation (SP) networks, Complete SP networks, encryption, data security, data encryption standard
11	Hideo Fujiwara, Kozo Kinoshita	On the Computational Complexity of System Diagnosis.	IEEE Trans. Computers	1978	DBLP DOI BibTeX RDF	polynomially complete, Fault diagnosis, polynomial time algorithm, Turing machines, self-diagnosable systems
11	Vinod K. Agarwal, Gerald M. Masson	Resolution-Oriented Fault Interrelationships in Combinational Logic Networks.	IEEE Trans. Computers	1977	DBLP DOI BibTeX RDF	Boolean difference, combinational logic networks, complete masking, fault dependent Boolean difference, fault dependent testing, fault interrelationships, fault resolution, multiple fault analysis, unresolvability, functional equivalence
11	Borzoo Bonakdarpour, Ali Ebnenasir, Sandeep S. Kulkarni	Complexity results in revising UNITY programs.	ACM Trans. Auton. Adapt. Syst.	2009	DBLP DOI BibTeX RDF	formal methods, UNITY
11	Gianluca Amato, Francesca Scozzari	Observational Completeness on Abstract Interpretation.	WoLLIC	2009	DBLP DOI BibTeX RDF
11	Paul Brodhead, Bjørn Kjos-Hanssen	The Strength of the Grätzer-Schmidt Theorem.	CiE	2009	DBLP DOI BibTeX RDF	computability theory, lattice theory
11	Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin	Average-Case Analyses of Vickrey Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST
11	Emine Yilmaz, Javed A. Aslam	Estimating average precision when judgments are incomplete.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	bpref, infAP, Evaluation, Robustness, Average precision, Incomplete judgments
11	David Avis, Hiroshi Imai, Tsuyoshi Ito	Generating facets for the cut polytope of a graph by triangular elimination.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52B12, 90C57, 05C99
11	José Meseguer 0001, Prasanna Thati	Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols.	High. Order Symb. Comput.	2007	DBLP DOI BibTeX RDF	Rewrite theories, Security protocols, Reachability, Narrowing
11	Salvatore La Torre, Gennaro Parlato	On the Complexity of LtlModel-Checking of Recursive State Machines.	ICALP	2007	DBLP DOI BibTeX RDF
11	Li-Chun Wang 0001, Chih-Wen Chang	On the performance of multicarrier DS-CDMA with imperfect power control and variable spreading factors.	IEEE J. Sel. Areas Commun.	2006	DBLP DOI BibTeX RDF
11	Shai Rubin, Somesh Jha, Barton P. Miller	On the Completeness of Attack Mutation Algorithms.	CSFW	2006	DBLP DOI BibTeX RDF
11	Anantharaman Lakshminarayanan, Tong-Lee Lim	Augmented Certificate Revocation Lists.	ACISP	2006	DBLP DOI BibTeX RDF
11	Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi	About the Lifespan of Peer to Peer Networks, .	OPODIS	2006	DBLP DOI BibTeX RDF
11	John H. Reif, Sudheer Sahu, Peng Yin 0003	Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems.	DNA	2005	DBLP DOI BibTeX RDF
11	Vincent Conitzer, Tuomas Sandholm	Complexity of (iterated) dominance.	EC	2005	DBLP DOI BibTeX RDF	(iterated) dominance, game theory
11	Lefteris M. Kirousis, Phokion G. Kolaitis	A Dichotomy in the Complexity of Propositional Circumscription.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
11	Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos	Poly-APX- and PTAS-Completeness in Standard and Differential Approximation.	ISAAC	2004	DBLP DOI BibTeX RDF
11	Stephen D. Travers	The Complexity of Membership Problems for Circuits over Sets of Integers.	MFCS	2004	DBLP DOI BibTeX RDF
11	Xingquan Zhu 0001, Xindong Wu 0001	Data Acquisition with Active and Impact-Sensitive Instance Selection.	ICTAI	2004	DBLP DOI BibTeX RDF
11	Julia Kempe, Alexei Y. Kitaev, Oded Regev 0001	The Complexity of the Local Hamiltonian Problem.	FSTTCS	2004	DBLP DOI BibTeX RDF
11	Eric Allender, Vikraman Arvind, Meena Mahajan	Arithmetic Complexity, Kleene Closure, and Formal Power Series.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF
11	Wonil Lee, Donghoon Chang, Sangjin Lee 0002, Soo Hak Sung, Mridul Nandi	New Parallel Domain Extenders for UOWHF.	ASIACRYPT	2003	DBLP DOI BibTeX RDF	UOWHF, masking assignment, sequential construciton, parallel construction, tree based construction, hash function
11	Harry G. Mairson, Kazushige Terui	On the Computational Complexity of Cut-Elimination in Linear Logic.	ICTCS	2003	DBLP DOI BibTeX RDF
11	Severino Villanueva Gervacio, Romulo C. Guerrero, Helen M. Rara	Folding Wheels and Fans.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
11	Giuseppe Della Penna, Benedetto Intrigila, Enrico Tronci, Marisa Venturini Zilli	Exploiting Transition Locality in the Disk Based Mur phi Verifier.	FMCAD	2002	DBLP DOI BibTeX RDF
11	Mitsunori Ogihara, Seinosuke Toda	The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.	MFCS	2001	DBLP DOI BibTeX RDF
11	S. Sriram, R. Tandon, Pallab Dasgupta, P. P. Chakrabarti 0001	Symbolic verification of Boolean constraints over partially specified functions.	ISCAS (5)	2001	DBLP DOI BibTeX RDF
11	James Laird	Finite Models and Full Completeness.	CSL	2000	DBLP DOI BibTeX RDF	affine logic, full completeness, effective presentability, linear logic, PCF
11	Héctor Muñoz-Avila, David W. Aha, Len Breslow, Dana S. Nau, Rosina Weber-Lee	Integrating Conversational Case Retrieval with generative Planning.	EWCBR	2000	DBLP DOI BibTeX RDF	Conversational case retrieval, integrations, planning
11	Arnaud Durand 0001, Miki Hermann, Laurent Juban	On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System.	MFCS	1999	DBLP DOI BibTeX RDF
11	Andreas Jakoby, Christian Schindelhauer	On the Complexity of Worst Case and Expected Time in a Circuit.	STACS	1996	DBLP DOI BibTeX RDF	expected time, computational complexity, average case analysis, worst case, theory of parallel and distributed computation, timed circuits
11	Volker Diekert, Edward Ochmanski, Klaus Reinhardt	On Confluent Semi-Commutations - Decidability and Complexity Results.	ICALP	1991	DBLP DOI BibTeX RDF
11	Staffan Bonnier	Unification in Incompletely Specified Theories: A Case Study.	MFCS	1991	DBLP DOI BibTeX RDF
11	Solomampionona Ranaivoson	Nontrivial Lower Bounds for some NP-Problems on Directed Graphs.	CSL	1990	DBLP DOI BibTeX RDF
11	Edmund M. Clarke	Programming Language Constructs for Which it is Impossible to Obtain "Good" Hoare-Like Axiom Systems.	POPL	1977	DBLP DOI BibTeX RDF
10	Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman, Andrzej Wasowski	Timed I/O automata: a complete specification theory for real-time systems.	HSCC	2010	DBLP DOI BibTeX RDF	specification theory, timed i/o automata, real-time, interfaces, refinement
10	Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, Philippe Suter	Complete functional synthesis.	PLDI	2010	DBLP DOI BibTeX RDF	bapa, synthesis procedure, decision procedure, presburger arithmetic
10	Dave Christie, Jae-Woong Chung, Stephan Diestelhorst, Michael Hohmuth, Martin Pohlack, Christof Fetzer, Martin Nowack, Torvald Riegel, Pascal Felber, Patrick Marlier, Etienne Rivière	Evaluation of AMD's advanced synchronization facility within a complete transactional memory stack.	EuroSys	2010	DBLP DOI BibTeX RDF	transactional memory
10	Muhammad Adeel Pasha, Steven Derrien, Olivier Sentieys	A complete design-flow for the generation of ultra low-power WSN node architectures based on micro-tasking.	DAC	2010	DBLP DOI BibTeX RDF	WSN node, hardware specialization, microcoded architecture, low-power design
10		Chandra and Harel Complete Query Languages.	Encyclopedia of Database Systems	2009	DBLP DOI BibTeX RDF
10	Peter Bürgisser, Felipe Cucker	Exotic Quantifiers, Complexity Classes, and Complete Problems.	Found. Comput. Math.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q15, 68Q17
10	Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo	Towards a Complete Scheme for Tabled Execution Based on Program Transformation.	PADL	2009	DBLP DOI BibTeX RDF	Continuation-call tabling, Performance, Program transformation, Implementation, Tabled logic programming
10	Katsuhiko Sano	Sound and Complete Tree-Sequent Calculus for Inquisitive Logic.	WoLLIC	2009	DBLP DOI BibTeX RDF
10	Isil Dillig, Thomas Dillig, Alex Aiken	Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers.	CAV	2009	DBLP DOI BibTeX RDF
10	Philippe Moret, Walter Binder, Alex Villazón	CCCP: complete calling context profiling in virtual execution environments.	PEPM	2009	DBLP DOI BibTeX RDF	calling context profiling, native code, java virtual machine, bytecode instrumentation
10	Liangcai Shu, Bo Long, Weiyi Meng	A Latent Topic Model for Complete Entity Resolution.	ICDE	2009	DBLP DOI BibTeX RDF
10	Pablo Cordero, Manuel Enciso, Ángel Mora 0001, Inmaculada Perez de Guzmán	A Complete Logic for Fuzzy Functional Dependencies over Domains with Similarity Relations.	IWANN (1)	2009	DBLP DOI BibTeX RDF
10	Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos	A Complete Characterisation of the Linear Clique-Width of Path Powers.	TAMC	2009	DBLP DOI BibTeX RDF
10	Gerold Jäger, Sharlee Climer, Weixiong Zhang	Complete Parsimony Haplotype Inference Problem and Algorithms.	ESA	2009	DBLP DOI BibTeX RDF
10	Alain Finkel, Jean Goubault-Larrecq	Forward Analysis for WSTS, Part II: Complete WSTS.	ICALP (2)	2009	DBLP DOI BibTeX RDF
10	Tom Schrijvers, Simon L. Peyton Jones, Martin Sulzmann, Dimitrios Vytiniotis	Complete and decidable type inference for GADTs.	ICFP	2009	DBLP DOI BibTeX RDF	Haskell, type inference, GADTs