Search results for "Complete"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	M. Vojdani Tabatabaee, M. Mehdi Ebrahimi	Metric and Complete Metric sigma-Frames.	Appl. Categorical Struct.	2003	DBLP DOI BibTeX RDF	cozero set, metric -frame, metric Lindelöf frame, complete -frame, frame
23	Sudhanva Gurumurthi, Anand Sivasubramaniam, Mary Jane Irwin, Narayanan Vijaykrishnan, Mahmut T. Kandemir, Tao Li 0006, Lizy Kurian John	Using Complete Machine Simulation for Software Power Estimation: The SoftWatt Approach.	HPCA	2002	DBLP DOI BibTeX RDF	Complete Machine Simulation, SimOS, Power Simulation, Operating System, Power Consumption
23	Frantisek Machala	Join-Independent and Meet-Independent Sets in Complete Lattices.	Order	2001	DBLP DOI BibTeX RDF	independent sets, complete lattices
23	N. S. Sundar, Doddaballapur Narasimha-Murthy Jayasimha, Dhabaleswar K. Panda 0001	Hybrid Algorithms for Complete Exchange in 2D Meshes.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	direct exchange, message contention, wormhole routing, Collective communication, hybrid algorithms, combining, barrier synchronization, complete exchange, mesh topology
23	Pranav Ashar, Aarti Gupta, Sharad Malik	Using complete-1-distinguishability for FSM equivalence checking.	ACM Trans. Design Autom. Electr. Syst.	2001	DBLP DOI BibTeX RDF	Bisimulation relation, complete-1-distinguishability, finite state machine equivalence, sequential logic synthesis, equivalence checking
23	SungSa Hong, YoungKyoung Kim	Cauchy Complete Nearness Spaces.	Appl. Categorical Struct.	2000	DBLP DOI BibTeX RDF	nearness spaces, regular Cauchy filters, Cauchy complete nearness spaces, Cauchy completions of nearness spaces, Cauchy maps
23	Marilena Mitrouli	On the Complete Pivoting Conjecture for Hadamard Matrices of Order 16.	NAA	2000	DBLP DOI BibTeX RDF	pivot size, complete pivoting, Hadamard matrices AMS Subject Classification: 65F05, 65G05, Gaussian elimination, 05B20
23	Huan-Chao Keh, Jen-Chih Lin	Simulation of Complete Binary Tree Structures in a Faulty Flexible Hypercube.	J. Sci. Comput.	1999	DBLP DOI BibTeX RDF	Flexible hypercube, embedding, complete binary tree
23	Sang Kyu Lee, Hyeong-Ah Choi	Embedding of Complete Binary Trees into Meshes with Row-Column Routing.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	row-column routing, link congestion, Embedding, mesh, complete binary tree
23	Karl M. Fant, Scott A. Brandt	NULL Convention LogicTM: A Complete And Consistent Logic For Asynchronous Digital Circuit Synthesis.	ASAP	1996	DBLP DOI BibTeX RDF	consistent logic, asynchronous digital circuit synthesis, symbolically complete logic, asynchronous digital circuits, asynchronous circuits, multivalued logic, three value logic, Boolean logic, NULL Convention Logic, four value logic
23	Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau	Embeddings of complete binary trees into star graphs with congestion 1.	HICSS (2)	1995	DBLP DOI BibTeX RDF	complete binary tree embeddings, vertex congestion, graph height, binary tree architecture, parallel architectures, multiprocessor interconnection networks, trees (mathematics), dilation, star graphs, algorithm simulation
23	Abdel Aziz Farrag, Robert J. Dawson	The Fault-Tolerant Extension Problem for Complete Multipartite Networks.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	fault-tolerant extension problem, complete multipartite networks, search time, fault tolerant computing, combinatorial problem
23	Etienne Grandjean, Frédéric Olive	Monadic Logical Definability of NP-Complete Problems.	CSL	1994	DBLP DOI BibTeX RDF	Computational complexity, NP-complete problem, nondeterminism, finite model theory, monadic second-order logic, linear time, random access machine
22	George E. Strecker	Flows With Respect to a Functor.	Appl. Categorical Struct.	2000	DBLP DOI BibTeX RDF	(E,M)-functor, coadjoint functor, wolf, strongly complete, extremally complete, completeness, factorization, flow
22	Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz	The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	minimum test sets, monotone combinational circuits, minimum complete test set, monotone PLAs, computational complexity, complexity, logic testing, NP-complete, logic arrays, combinatorial circuits, literals
22	Severino Villanueva Gervacio	Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs.	IJCCGGT	2003	DBLP DOI BibTeX RDF
22	Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani	On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.	ADHOC-NOW	2009	DBLP DOI BibTeX RDF	Intruder, Optimal Movement, Sensors, NP-complete, Coverage, Detection, PTAS, Barrier, Line Segment
22	Sama Goliaei, Saeed Jalili	An Optical Wavelength-Based Solution to the 3-SAT Problem.	OSC	2009	DBLP DOI BibTeX RDF	Wavelength-Based Approach, 3-SAT Problem, NP- Complete, Optical Computing, Unconventional Computing
21	Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang	Autoreducibility, Mitoticity, and Immunity.	MFCS	2005	DBLP DOI BibTeX RDF
21	Mike Reed	Order, Topology, and Recursion Induction in CSP.	25 Years Communicating Sequential Processes	2004	DBLP DOI BibTeX RDF
21	Harry Buhrman, Leen Torenvliet	Separating Complexity Classes Using Structural Properties.	CCC	2004	DBLP DOI BibTeX RDF
21	Burkhard Monien, Ivan Hal Sudborough	Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey).	MFCS	1981	DBLP DOI BibTeX RDF
21	Sanatan Rai, George L. Vairaktarakis	NP-complete Problems and Proof Methodology.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Polynomial time reduction, strong NP-completeness, ordinary NP-completeness, Computational complexity, Reducibility, NP-complete problem, NP-hard problem
21	Jun-Bao Li, Jeng-Shyang Pan 0001, Zhe-Ming Lu	Face recognition using Gabor-based complete Kernel Fisher Discriminant analysis with fractional power polynomial models.	Neural Comput. Appl.	2009	DBLP DOI BibTeX RDF	Complete Kernel Fisher Discriminant (CKFD), Fractional Power Polynomial (FPP) models, Face recognition, Gabor wavelet, Kernel-based method
21	Yining Wu, Martin Caminada, Dov M. Gabbay	Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming.	Stud Logica	2009	DBLP DOI BibTeX RDF	abstract argumentation, complete extensions, 3-valued stable models, logic programming
21	Yu Wang 0004, Xin Zheng	Non-complete Topological Analysis in Image-Based 3D Building Reconstruction.	HCI (7)	2009	DBLP DOI BibTeX RDF	non-complete topology analysis, weighted recognition algorithm, 3D reconstruction
21	Francis Y. L. Chin, Zeyu Guo 0001, He Sun 0001	Minimum Manhattan network is NP-complete.	SCG	2009	DBLP DOI BibTeX RDF	3-sat, minimum Manhattan network, NP-complete
21	Xiuli Xu, Ping Guo 0002	Iris Feature Extraction Based on the Complete 2DPCA.	ISNN (2)	2009	DBLP DOI BibTeX RDF	Complete 2DPCA, Equal error rate, Feature extraction, Iris recognition
21	Taichi Haruna, Yukio-Pegio Gunji	Double Approximation and Complete Lattices.	RSKT	2009	DBLP DOI BibTeX RDF	equivalence of categories, Rough sets, representation theorem, complete lattices
21	Jie Zhou 0009, Duoqian Miao, Qinrong Feng, Lijun Sun	Research on Complete Algorithms for Minimal Attribute Reduction.	RSKT	2009	DBLP DOI BibTeX RDF	minimal reduct, complete algorithm, decision table, discernibility function
21	Kiyoshi Sawada	Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree.	SNPD	2008	DBLP DOI BibTeX RDF	Liaison, Shortest path, Complete Binary tree, Organization structure
21	Wuu Yang, Huei-Ru Tseng, Rong-Hong Jan, Bor-Yeh Shen	Broadcasting with the Least Energy is an NP-Complete Problem.	MUE	2008	DBLP DOI BibTeX RDF	least-energy problem, maximum-leaf spanning-tree problem, wireless network, graph theory, NP-complete
21	Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap	Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves.	ISSAC	2008	DBLP DOI BibTeX RDF	complete numerical algorithm, evaluation bound, implicit algebraic curve, root bound, meshing, singularity, subdivision algorithm
21	Toufiq Benbouziane, Hassan El Houari, M'hammed El Kahoui	Polynomial parametrization of nonsingular complete intersection curves.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Complete intersection, Locally nilpotent derivation, Polynomial parametrization
21	Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai	Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	wireless sensor networks, NP-Complete, coverage problem
21	Simson L. Garfinkel	Complete delete vs. time machine computing.	ACM SIGOPS Oper. Syst. Rev.	2007	DBLP DOI BibTeX RDF	MacOS, complete delete, file vault, secure empty trash, time machine computing
21	Maria Castillo, Federico Fariña, Alberto Córdoba, Jesús E. Villadangos	A Modified O(n) Leader Election Algorithm for Complete Networks.	PDP	2007	DBLP DOI BibTeX RDF	distributed algorithms, leader election, I/O automata, complete networks
21	Shakeel Ahmad, Irfan Awan, Bashir Ahmad 0001	Performance Modelling of Finite Capacity Queues with Complete Buffer Partitioning Scheme for Bursty Traffic.	Asia International Conference on Modelling and Simulation	2007	DBLP DOI BibTeX RDF	Complete partitioning queues, performance modelling, bursty traffic
21	Gordan Zitkovic	Financial equilibria in the semimartingale setting: Complete markets and markets with withdrawal constraints.	Finance Stochastics	2006	DBLP DOI BibTeX RDF	financial equilibrium, complete markets, semimartingales, semimartingale functions, withdrawal constraints
21	Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser	On the Crossing Number of Complete Graphs.	Computing	2006	DBLP DOI BibTeX RDF	enumeration, Crossing number, complete graph, order types
21	Joachim Biskup, Lena Wiese	On Finding an Inference-Proof Complete Database for Controlled Query Evaluation. (PDF / PS)	DBSec	2006	DBLP DOI BibTeX RDF	confidentiality of data, complete database systems, Branch and Bound, propositional logic, inference control, SAT solving, lying, Controlled Query Evaluation
21	Mordechai Ben-Ari	Minesweeper as an NP-complete problem.	ACM SIGCSE Bull.	2005	DBLP DOI BibTeX RDF	minesweeper, NP-complete, SAT
21	Hadi Kharaghani, Rouzbeh Torabi	On a Decomposition of Complete Graphs.	Graphs Comb.	2003	DBLP DOI BibTeX RDF	Strongly regular graph, Balanced generalized weighing matrix, Complete graph, Symmetric design, Difference set
21	Stefan Dobrev	Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF	Sense of Direction, Fault Tolerance, Distributed Computing, Broadcasting, Dynamic Faults, Complete Networks
21	Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser	On the crossing number of complete graphs.	SCG	2002	DBLP DOI BibTeX RDF	rectilinear crossing number, complete graph, order type
21	Zoltán Ésik, Hans Leiß	Greibach Normal Form in Algebraically Complete Semirings.	CSL	2002	DBLP DOI BibTeX RDF	Greibach normal form, pre-fixed-point induction, Conway algebra, algebraically complete semirings, context-free languages, Kleene algebra, equational theory
21	Iwan M. Duursma, Carlos Rentería-Márquez, Horacio Tapia-Recillas	Reed-Muller Codes on Complete Intersections.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Complete intersection, Hilbert polynomial, Vanishing ideal, a -invariant of an ideal, Graded finite free resolution, Canonical module, Reed-Muller code
21	Taosong He, Lichan Hong, Dongqing Chen, Zhengrong Liang	Reliable Path for Virtual Endoscopy: Ensuring Complete Examination of Human Organs.	IEEE Trans. Vis. Comput. Graph.	2001	DBLP DOI BibTeX RDF	Virtual endscopy, reliable path, reliable navigation, NP-complete, visibility, camera control
21	Ben C. Moszkowski	A Complete Axiomatization of Interval Temporal Logic with Infinite Time.	LICS	2000	DBLP DOI BibTeX RDF	complete axiom systems, Buechi-automata, temporal logic, regular expressions, finite-state automata, omega-automata
21	Lee J. White, Husain Almezen	Generating Test Cases for GUI Responsibilities Using Complete Interaction Sequences.	ISSRE	2000	DBLP DOI BibTeX RDF	GUI Object Collaboration, Complete Interaction Sequences, Graphical User Interfaces, GUI Testing
21	Jan Trdlicka, Pavel Tvrdík	Embedding Complete k-ary Trees into 2-dimensional Meshes and Tori.	Euro-Par	1997	DBLP DOI BibTeX RDF	complete k-ary tree, 2-dimensional square mesh, embedding problem, dilation, expansion, load
21	Hal Burch, Fikret Erçal	A Fast Algorithm for Complete Subcube Recognition.	ISPAN	1997	DBLP DOI BibTeX RDF	complete subcube recognition, order of complexity, parallel algorithms, processor allocation, hypercube topology
21	Eric Bach 0001, Anne Condon, Elton Glaser, Celena Tanguay	DNA Models and Algorithms for NP-complete Problems.	CCC	1996	DBLP DOI BibTeX RDF	3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems
21	Juan Sabia, Pablo Solernó	Bounds for traces in complete intersections and degrees in the Nullstellensatz.	Appl. Algebra Eng. Commun. Comput.	1995	DBLP DOI BibTeX RDF	Complete intersection polynomial ideals, Bezout’s inequality, Effective Nullstellensatz, Bertini’s theorem, Trace theory
21	Alon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks	Optimal Distributed t-Resilient Election in Complete Networks.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	optimal distributed t-resilient election, distributed leader election, election algorithm, fault-free network, software engineering, fault tolerant computing, distributed processing, computer networks, message complexity, complete networks
21	Pierre America, Jan J. M. M. Rutten	Solving Reflexive Domain Equations in a Category of Complete Metric Spaces.	MFPS	1987	DBLP DOI BibTeX RDF	complete metric spaces, converging towers, contracting functors, Banach's fixed-point theorem, category theory, domain equations
20	Clemens Ley, Michael Benedikt	How big must complete XML query languages be?	ICDT	2009	DBLP DOI BibTeX RDF
20	Chaomin Luo, Simon X. Yang	A Bioinspired Neural Network for Real-Time Concurrent Map Building and Complete Coverage Robot Navigation in Unknown Environments.	IEEE Trans. Neural Networks	2008	DBLP DOI BibTeX RDF
20	Anh Quang Pham, Lie-Liang Yang, Lajos Hanzo	Unequal Error Protection Irregular Over-Complete Mapping for Wavelet Coded Wireless Video Telephony Using Iterative Source and Channel Decoding.	WCNC	2008	DBLP DOI BibTeX RDF
20	Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari	Building Complete Abstract Interpretations in a Linear Logic-based Setting.	SAS	1998	DBLP DOI BibTeX RDF
20	Naveen Prakash	Complete Methods for Building Complete Applications.	Situational Method Engineering	2007	DBLP DOI BibTeX RDF
20	Matatyahu Rubin	On Lalpha, omega complete extensions of complete theories of Boolean algebras.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	L1, Tarskis invariants
19	Weng-Long Chang, Minyi Guo, Jesse Wu	Is Cook's Theorem Correct for DNA-Based Computing?	ISHPC	2003	DBLP DOI BibTeX RDF	NP-complete Problem, Molecular Computing, Biological Computing, DNA-based Computing
19	Hua Liu, Huilai Zou, Lili Zhong, Chaonan Wang, Youtian Qu	Improvement of the Optimal Hamilton Circuit for Undirected Complete Graph.	CIT	2010	DBLP DOI BibTeX RDF	undirected complete graph, Optimal Hamilton Circuit, Gradually Convergent Algorithm, Cross-wire Cutting Algorithm, Nearest Neighbor Algorithm
19	Tetsuya Kojima, Yoshiya Horii, Naoki Ohtani, Thierno Sene	On Some Properties of a Digital Watermarking Based on Complete Complementary Codes.	IIH-MSP	2010	DBLP DOI BibTeX RDF	complete complementary code, spread-spectrum system, DCT, digital watermarking
19		Effect of Cooperative Communication on Steganography Based on NP-Complete Theory.	ESIAT (1)	2009	DBLP DOI BibTeX RDF	NP-complete theory, steganography, effect, cooperative communication
19	Hanmin Jung, Mikyoung Lee, Beom-Jong You, Do-Wan Kim	Comparative Evaluation of Reliabilities on Semantic Search Functions: Auto-complete and Entity-Centric Unified Search.	AMT	2009	DBLP DOI BibTeX RDF	Unified Search, Entity-centric Search, Ontology, Semantic Web, Reliability, Usability Test, Semantic Search, Named Entity, Auto-complete
19	Tarek Sayed Ahmed	On Complete Representations of Reducts of Polyadic Algebras.	Stud Logica	2008	DBLP DOI BibTeX RDF	polyadic algebras, complete representations, Algebraic logic
19	Joachim Biskup, Piero A. Bonatti	Controlled query evaluation for enforcing confidentiality in complete information systems.	Int. J. Inf. Sec.	2004	DBLP DOI BibTeX RDF	Complete information system, Confidentiality, Inference control, Lying, Refusal
19	Hiroki Wada, Toshimitsu Masuzawa, Kewal K. Saluja, Hideo Fujiwara	Design for Strong Testability of RTL Data Paths to Provide Complete Fault Efficiency.	VLSI Design	2000	DBLP DOI BibTeX RDF	Complete fault efficiency, Design for testability, Data path, Hierarchical test
19	David W. Binkley, Bradley M. Kuhn	Crozzle: an NP-complete problem.	SAC	1997	DBLP DOI BibTeX RDF	crozzle, complexity, NP-complete
19	P. Bosch, A. Carloganu, Daniel Etiemble	Complete x86 instruction trace generation from hardware bus collect.	EUROMICRO	1997	DBLP DOI BibTeX RDF	complete x86 instruction trace generation, hardware bus collect, architectural improvements, benchmark traces, hardware/software approach, x86 execution traces, commercial analyzer, computer architecture, microprocessors, memory hierarchies, trace driven simulation, performance data
19	Steven M. Seitz, Charles R. Dyer	Complete Scene Structure from Four Point Correspondences.	ICCV	1995	DBLP DOI BibTeX RDF	complete scene structure, four point correspondences, 3D scene structure, reference features, affine camera model, reconstructible features, motion techniques, edge detection, image sequences, image reconstruction, completeness, programming theory, real images, recursive algorithm, natural scenes, unified framework, parallax, feature correspondence, structure recovery, line features
19	Hosame Abu-Amara, Jahnavi Lokre	Election in Asynchronous Complete Networks with Intermittent Link Failures.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	fault-tolerant leader election, asynchronous complete networks, intermittent link failures, fully-connected distributed networks, reliable processors, communication channel failures, algorithm execution, faulty channels, processor identifier set cardinality, undetectable faults, reliability, distributed algorithms, fault tolerant computing, communication complexity, failure analysis, message complexity, telecommunication channels, telecommunication network management
19	Brenda S. Baker	Approximation Algorithms for NP-Complete Problems on Planar Graphs.	J. ACM	1994	DBLP DOI BibTeX RDF	partition into perfect matchings, partition into triangles, approximation algorithms, NP-complete, planar graphs, dominating set, independent set, vertex cover, approximation schemes, Hamiltonian path, Hamiltonian circuit
19	Po-Jen Chuang, Nian-Feng Tzeng	A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	processor allocation strategy, binary tree representations, complete subcube recognition, performance evaluation, computational complexity, resource allocation, performance measures, hypercube networks, hypercube computers, allocation strategies
19	Ajay K. Gupta 0001, Susanne E. Hambrusch	Embedding Complete Binary Trees into Butterfly Networks.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	wrap-around connections, multiprocessor interconnection networks, embeddings, trees (mathematics), complete binary trees, butterfly networks
19	Pramode Ranjan Bhattacharjee, Sanjoy Kumar Basu, Jogesh Chandra Paul	Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	complete test set generation, logical expressions, real transforms, logic programming, logic testing, Boolean function, Boolean functions, formal logic, pseudo-Boolean programming
19	Vassilis Zissimopoulos, Vangelis Th. Paschos, Ferhan Pekergin	On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	Boltzmann machine method, minimum vertex cover, computational complexity, parallel architectures, approximation, neural nets, NP-complete problems, heuristic programming, covering, clique, combinatorial mathematics, optimal solutions, maximum independent set, set partitioning, packing problems, minimum set cover
19	Vijay Raghavan 0002, Anand R. Tripathi	Sequential Diagnosability is Co-NP Complete.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	graph theory model, weighted model, co-NP complete, sequential diagnosability number, BGM models, computational complexity, graph theory, fault diagnosis, fault tolerant computing, software reliability, planar graphs, decision problem, PMC model
19	Uriel Feige, Shafi Goldwasser, László Lovász 0001, Shmuel Safra, Mario Szegedy	Approximating Clique is Almost NP-Complete (Preliminary Version)	FOCS	1991	DBLP DOI BibTeX RDF	approximation procedures, approximating clique, almost NP-complete, computational complexity, graph
19	Moiez A. Tapia, Jerry H. Tucker	Complete Solution of Boolean Equations.	IEEE Trans. Computers	1980	DBLP DOI BibTeX RDF	reduced solutions, characteristic equation, complete solutions, number of distinct solutions, parameterized solutions, Boolean algebra, Boolean equations
18	Hai Zhou 0001	Retiming and resynthesis with sweep are complete for sequential transformation.	FMCAD	2009	DBLP DOI BibTeX RDF
18	Lyublena Antova, Christoph Koch 0001, Dan Olteanu	From complete to incomplete information and back.	SIGMOD Conference	2007	DBLP DOI BibTeX RDF	hypothetical queries, world-set algebra, use cases, incomplete information, query rewriting
18	Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian	Complete partitions of graphs.	SODA	2005	DBLP BibTeX RDF
18	Gek Ling Chia, V. L. Chia	On the Choice Numbers of Some Complete Multipartite Graphs.	CJCDGCGT	2005	DBLP DOI BibTeX RDF
18	Qing Wang 0006, David Dagan Feng	A Novel Texture Descriptor Using Over-Complete Wavelet Transform and Its Fractal Signature.	CIVR	2005	DBLP DOI BibTeX RDF
18	Nadia Nedjah, Luiza de Macedo Mourelle	Complete Pattern Matching: Recursivity Versus Multi-threading.	VECPAR	2004	DBLP DOI BibTeX RDF
18	Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann 0001, Sebastiaan Terwijn	Almost Complete Sets.	STACS	2000	DBLP DOI BibTeX RDF
18	Akira Matsubayashi, Ryo Takasu	Minimum Congestion Embedding of Complete Binary Trees into Tori.	COCOON	1999	DBLP DOI BibTeX RDF
18	Xiao Zhou 0001, Takao Nishizeki	The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.	ISAAC	1998	DBLP DOI BibTeX RDF
18	Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari	Complete Abstract Interpretations Made Constructive.	MFCS	1998	DBLP DOI BibTeX RDF
18	Rastislav Bodík, Rajiv Gupta 0001, Mary Lou Soffa	Complete Removal of Redundant Computations.	PLDI	1998	DBLP DOI BibTeX RDF	control flow restructuring, demand-driven frequency data-flow analysis, speculative execution, partial redundancy elimination, profile-guided optimization
18	Rastislav Bodík, Rajiv Gupta 0001, Mary Lou Soffa	Complete removal of redundant expressions (with retrospective)	Best of PLDI	1998	DBLP DOI BibTeX RDF	control flow restructuring, demand-driven frequency data-flow analysis, speculative execution, partial redundancy elimination, profile-guided optimization
18	Alexandre Boudet, Evelyne Contejean, Claude Marché	AC-Complete Unification and its Application to Theorem Proving.	RTA	1996	DBLP DOI BibTeX RDF
17	Floris Geerts, Sofie Haesevoets, Bart Kuijpers	First-order complete and computationally complete query languages for spatio-temporal databases.	ACM Trans. Comput. Log.	2008	DBLP DOI BibTeX RDF	query languages, spatial databases, moving objects, spatio-temporal databases, Constraint databases
17	Artiom Alhazov, Liudmila Burtseva, Svetlana Cojocaru, Yurii Rogozhin	Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes.	Workshop on Membrane Computing	2008	DBLP DOI BibTeX RDF
17	Daniel J. Bernstein, Tanja Lange 0001, Reza Rezaeian Farashahi	Binary Edwards Curves.	CHES	2008	DBLP DOI BibTeX RDF	Edwards curves, complete addition law, Montgomery ladder, countermeasures against side-channel attacks, Elliptic curves, binary fields
17	Olivier Finkel, Dominique Lecomte	There Exist Some omega -Powers of Any Borel Rank.	CSL	2007	DBLP DOI BibTeX RDF	Infinite words, ?-languages, ?-powers, Cantor topology, topological complexity, Borel sets, Borel ranks, complete sets
17	Olivier Finkel	On the Accepting Power of 2-Tape Büchi Automata.	STACS	2006	DBLP DOI BibTeX RDF	2-tape Büchi automata, infinitary rational relations, Cantor topology, topological complexity, Borel hierarchy, complete sets