Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Nicholas Georgiou |
Embeddings and Other Mappings of Rooted Trees Into Complete Trees. |
Order |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Petr Lisonek, Mahdad Khatirinejad |
A Family of Complete Caps in PG(n, 2). |
Des. Codes Cryptogr. |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Ram Ramanathan, Jason Redi, Cesar A. Santivanez, David Wiggins, Stephen Polit |
Ad hoc networking with directional antennas: a complete system solution. |
IEEE J. Sel. Areas Commun. |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Yiannis Andreopoulos, Adrian Munteanu 0001, Geert Van Der Auwera, Jan Cornelis 0001, Peter Schelkens |
Complete-to-overcomplete discrete wavelet transforms: theory and applications. |
IEEE Trans. Signal Process. |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Scott Aaronson |
Guest Column: NP-complete problems and physical reality. |
SIGACT News |
2005 |
DBLP DOI BibTeX RDF |
|
12 | David Gamarnik |
The expected value of random minimal length spanning tree of a complete graph. |
SODA |
2005 |
DBLP BibTeX RDF |
|
12 | Alan Mishchenko, Robert K. Brayton |
SAT-Based Complete Don't-Care Computation for Network Optimization. |
DATE |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Yongqiang Zhao, Wenjie He, Yufa Shen, Yanning Wang |
Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs. |
CJCDGCGT |
2005 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications 05C15 |
12 | Emeric Gioan |
Complete Graph Drawings Up to Triangle Mutations. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Matthias Rätsch, Sami Romdhani, Gerd Teschke, Thomas Vetter |
Over-Complete Wavelet Approximation of a Support Vector Machine for Efficient Classification. |
DAGM-Symposium |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Ryo Yoshinaka |
Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Prasanna Thati, José Meseguer 0001 |
Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing. |
CALCO |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Michael Dom, Jiong Guo, Rolf Niedermeier |
Bounded Degree Closest k-Tree Power Is NP-Complete. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Jianer Chen, Fenghui Zhang |
On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4]. |
AAIM |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Carsten Lutz |
NEXP TIME-complete description logics with concrete domains. |
ACM Trans. Comput. Log. |
2004 |
DBLP DOI BibTeX RDF |
NExpTime-completeness, concrete domains, domino problem, Computational complexity, description logic, post correspondence problem |
12 | Tung Chong Wong, Jon W. Mark, Kee Chaing Chua |
Performance Analysis of Variable Bit Rate Multiclass Services in the Uplink of a Dynamic Complete Partitioning Round-Robin Carrier-Hopping Multirate Multi-carrier DS-CDMA System. |
NETWORKING |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert |
Complete, exact, and efficient computations with cubic curves. |
SCG |
2004 |
DBLP DOI BibTeX RDF |
sweep-line algorithm, computational geometry, robustness, arrangements, algebraic curves, exact geometric computation |
12 | Haifeng Shen, Chengzheng Sun |
A Complete Textual Merging Algorithm for Software Configuration Management Systems. |
COMPSAC |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Anca Muscholl, Igor Walukiewicz |
An NP-Complete Fragment of LTL. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Chunyan Yu, Wu Haihong, Minghui Wu 0001 |
A complete model for collaborative virtual environment integrating extended fuzzy-timing Petri nets with role and agent technology. |
SMC (6) |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Chang-Heng Chang, Li-Ching Hsieh, Ta-Yuan Chen, Hong-Da Chen, Liaofu Luo, Hoong-Chien Lee |
Shannon Information in Complete Genomes. |
CSB |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Régis Barbanchon, Etienne Grandjean |
The Minimal Logically-Defined NP-Complete Problem. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
Computational complexity, NP-completeness, descriptive complexity, finite model theory, parsimony, second-order logic |
12 | Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret |
Monadic Second-Order Unification Is NP-Complete. |
RTA |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Rajiv T. Maheswaran, Milind Tambe, Emma Bowring, Jonathan P. Pearce, Pradeep Varakantham |
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling. |
AAMAS |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Amit Sahai, Salil P. Vadhan |
A complete problem for statistical zero knowledge. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
Knowledge complexity, statistical difference, zero knowledge, proof systems |
12 | David Carrera 0001, Jordi Guitart, Jordi Torres, Eduard Ayguadé, Jesús Labarta |
Complete instrumentation requirements for performance analysis of Web based technologies. |
ISPASS |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Paz Carmi, Thomas Erlebach, Yoshio Okamoto |
Greedy Edge-Disjoint Paths in Complete Graphs. |
WG |
2003 |
DBLP DOI BibTeX RDF |
Shortening lemma, Approximation algorithm, Greedy algorithm |
12 | Yukiyoshi Kameyama, Masahito Hasegawa |
A sound and complete axiomatization of delimited continuations. |
ICFP |
2003 |
DBLP DOI BibTeX RDF |
continuation, axiomatization, CPS-translation |
12 | Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis |
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Jan Stola |
3D Visibility Representations of Complete Graphs. |
GD |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Yaron Gvili, Nir A. Sochen |
A Complete System of Measurement Invariants for Abelian Lie Transformation Groups. |
Scale-Space |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Mario Donato Marino |
A Preliminary Proposal of a Complete Environment for Practical DSMs's Evaluation based on Benchmarks's Execution. |
HPCS |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Paul Gastin, Madhavan Mukund |
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
12 | Bharat Adsul, Milind A. Sohoni |
Complete and Tractable Local Linear Time Temporal Logics over Traces. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
Concurrency, Temporal Logics, Limits, Mazurkiewicz Traces |
12 | Shigeto Seno, Reiji Teramoto, Hideo Matsuda |
P-quasi Complete Linkage Analysis for Gene-Expression Data. |
CSB |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Eran Gery, David Harel, Eldad Palachi |
Rhapsody: A Complete Life-Cycle Model-Based Development System. |
IFM |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Tomoko Ninomiya, Masao Mukaidono |
Independence of Each Axiom in a Set of Axioms and Complete Sets of Axioms of Boolean Algebra. |
ISMVL |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Soon-Yong Park, Murali Subbarao |
Pose Estimation and Integration for Complete 3D Model Reconstruction. |
WACV |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Nobuo Tsuda |
Configurable PC Clusters Using a Hierarchical Complete-Connection-Based Switching Network. |
PRDC |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Stefano Chessa, Piero Maestrini |
Correct and Almost Complete Diagnosis of Processor Grids. |
IEEE Trans. Computers |
2001 |
DBLP DOI BibTeX RDF |
processor grids, constant-degree diagnosis, System-level diagnosis, PMC model, diagnosis algorithm |
12 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro |
On universally easy classes for NP-complete problems. |
SODA |
2001 |
DBLP BibTeX RDF |
|
12 | Joachim Apel |
Passive Complete Orthonomic Systems of PDEs and Involutive Bases of Polynomial Modules. |
SNSC |
2001 |
DBLP DOI BibTeX RDF |
|
12 | Sébastien Ferré |
Complete and Incomplete Knowledge in Logical Information Systems. |
ECSQARU |
2001 |
DBLP DOI BibTeX RDF |
|
12 | Taro Suzuki, Aart Middeldorp |
A Complete Selection Function for Lazy Conditional Narrowing. |
FLOPS |
2001 |
DBLP DOI BibTeX RDF |
|
12 | Noriyuki Fujimoto, Kenichi Hagihara |
Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays. |
PPAM |
2001 |
DBLP DOI BibTeX RDF |
|
12 | Irfan Siap |
The Complete Weight Enumerator for Codes over Mn×s(Fq). |
IMACC |
2001 |
DBLP DOI BibTeX RDF |
|
12 | Inês Lynce, Luís Baptista, João Marques-Silva 0001 |
Towards Provably Complete Stochastic Search Algorithms for Satisfiability. |
EPIA |
2001 |
DBLP DOI BibTeX RDF |
|
12 | Grigore Rosu |
Complete Categorical Equational Deduction. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
12 | Wan J. Fokkink, S. P. Luttik |
An omega-Complete Equational Specification of Interleaving. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Mario Bravetti, Roberto Gorrieri |
A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Stefan Dobrev |
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Arnaud Durand 0001, Miki Hermann, Phokion G. Kolaitis |
Subtractive Reductions and Complete Problems for Counting Complexity Classes. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa |
Parallelizability of Some P-Complete Problems. |
IPDPS Workshops |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Tao Li 0006, Lizy Kurian John, Narayanan Vijaykrishnan, Anand Sivasubramaniam, Jyotsna Sabarinathan, Anupama Murthy |
Using complete system simulation to characterize SPECjvm98 benchmarks. |
ICS |
2000 |
DBLP DOI BibTeX RDF |
Java |
12 | Bao-Liang Lu, Michinori Ichikawa |
Emergence of Learning: An Approach to Coping with NP-Complete Problems in Learning. |
IJCNN (4) |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Karl Lermer, Paul A. Strooper |
A Single Complete Refinement Rule for Demonic Specifications. |
IFIP TCS |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Anthony T. C. Tam, Cho-Li Wang |
Contention-free Complete Exchange Algorithm on Clusters. |
CLUSTER |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Martin Grohe |
Equivalence in Finite-Variable Logics is Complete for Polynomial Time. |
Comb. |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 03C13, 05C60, 68Q15 |
12 | Pierre M. Devaux, Daniel B. Lysak, Rangachar Kasturi |
A complete system for the intelligent interpretation of engineering drawings. |
Int. J. Document Anal. Recognit. |
1999 |
DBLP DOI BibTeX RDF |
3D Drawing interpretation, Image processing, Document image analysis, Graphics recognition, Engineering drawings |
12 | Éric Marchand, François Chaumette |
An Autonomous Active Vision System for Complete and Accurate 3D Scene Reconstruction. |
Int. J. Comput. Vis. |
1999 |
DBLP DOI BibTeX RDF |
bayes nets, visual serving, exploration, active vision, scene reconstruction |
12 | Rom Langerak, Ed Brinksma |
A Complete Finite Prefix for Process Algebra. |
CAV |
1999 |
DBLP DOI BibTeX RDF |
|
12 | Mariusz Meszka, Zdzislaw Skupien |
Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs. |
Comb. |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C70, 05C20 |
12 | Drago Krznaric, Christos Levcopoulos |
Fast Algorithms for Complete Linkage Clustering. |
Discret. Comput. Geom. |
1998 |
DBLP DOI BibTeX RDF |
|
12 | Farid Ajili, Hendrik C. R. Lock |
Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems. |
PLILP/ALP |
1998 |
DBLP DOI BibTeX RDF |
|
12 | Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto |
Splitting Number is NP-complete |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
12 | Jochen Meßner, Jacobo Torán |
Optimal Proof Systems for Propositional Logic and Complete Sets. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
12 | Amir Fijany, Colin P. Williams |
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits. |
QCQC |
1998 |
DBLP DOI BibTeX RDF |
|
12 | Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering |
Toward a Complete Transformational Toolkit for Compilers. |
ACM Trans. Program. Lang. Syst. |
1997 |
DBLP DOI BibTeX RDF |
compiler intermediate representation, program transformation, completion, partial evaluation, term-rewriting, imperative language |
12 | David Janin |
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
12 | Marcelo P. Fiore, Gordon D. Plotkin, A. John Power |
Complete Cuboidal Sets in Axiomatic Domain Theory. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
12 | Klaus-Jörn Lange |
Are There Formal Languages Complete for SymSPACE(log n)? |
Foundations of Computer Science: Potential - Theory - Cognition |
1997 |
DBLP DOI BibTeX RDF |
|
12 | Klaus-Jörn Lange |
An Unambiguous Class Possessing a Complete Set. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
Topics Computational and structural complexity theory |
12 | Tzung-Shi Chen, Yu-Chee Tseng, Jang-Ping Sheu |
Balanced Spanning Trees in Complete and Incomplete Star Graphs. |
IEEE Trans. Parallel Distributed Syst. |
1996 |
DBLP DOI BibTeX RDF |
Balanced spanning tree, personalized broadcast, interconnection network, parallel architecture, star graph |
12 | Allan Cheng, Dexter Kozen |
A Complete Gentzen-Style Axiomatization for Set Constraints. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
|
12 | Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering |
A Complete Transformational Toolkit for Compilers. |
ESOP |
1996 |
DBLP DOI BibTeX RDF |
|
12 | Eric Salvat, Marie-Laure Mugnier |
Sound and Complete Forward and backward Chainingd of Graph Rules. |
ICCS |
1996 |
DBLP DOI BibTeX RDF |
|
12 | Pranav Ashar, Aarti Gupta, Sharad Malik |
Using complete-1-distinguishability for FSM equivalence checking. |
ICCAD |
1996 |
DBLP DOI BibTeX RDF |
sequential logic synthesis and verification, finite state machine equivalence, bisimulation relation, 1-distinguishability, 1-equivalence, formal verification |
12 | Prasanti Uppaluri, Uwe Sparmann, Irith Pomeranz |
On minimizing the number of test points needed to achieve complete robust path delay fault testability. |
VTS |
1996 |
DBLP DOI BibTeX RDF |
robust path delay fault testability, RD fault identification, fault diagnosis, logic testing, delays, test generation, combinational circuits, combinational circuit, test point insertion |
12 | Marcus Schäfer 0001 |
Deciding the Vapnik-Cervonenkis dimension is SigmaP3-complete. |
CCC |
1996 |
DBLP DOI BibTeX RDF |
computational complexity, VC dimension |
12 | Michal Walicki, Sigurd Meldal |
A Complete Calculus for the Multialgebraic and Functional Semantics of Nondeterminism. |
ACM Trans. Program. Lang. Syst. |
1995 |
DBLP DOI BibTeX RDF |
reasoning with nondeterminism, algebraic specifications |
12 | Osamu Maruyama, Satoru Miyano |
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete. |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
12 | Bruno Durand 0001 |
A Random NP-Complete Problem for Inversion of 2D Cellular Automata. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
Topics computational complexity, computer systems theory, cryptography, automata and formal languages |
12 | Irith Pomeranz, Sudhakar M. Reddy |
On achieving complete fault coverage for sequential machines. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1994 |
DBLP DOI BibTeX RDF |
|
12 | Georg Karner |
A Topology for Complete Semirings. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
12 | Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng |
Existence and Nonexistence of Complete Refinement Operators. |
ECML |
1994 |
DBLP DOI BibTeX RDF |
|
12 | V. Vajner |
The category of complete Boolean algebras is not an intersection of reflective subcategories of the category of frames. |
Appl. Categorical Struct. |
1993 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (1991) 18A40, 06E10 |
12 | Rob J. van Glabbeek |
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
12 | Klaus Jansen |
A Rainbow About T-Colorings for Complete Graphs. |
WG |
1993 |
DBLP DOI BibTeX RDF |
|
12 | R. Z. Hwang, Richard C. T. Lee |
The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
12 | Werner Hans |
A Complete Indexing Scheme for WAM-based Abstract Machines. |
PLILP |
1992 |
DBLP DOI BibTeX RDF |
|
12 | Robert F. Stärk |
Negation-Complete Logic Programs. |
CSL |
1992 |
DBLP DOI BibTeX RDF |
|
12 | Yolanda Ortega-Mallén, David de Frutos-Escrig |
A Complete Proof System for Timed Observations. |
TAPSOFT, Vol.1 |
1991 |
DBLP DOI BibTeX RDF |
|
12 | Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger |
Optimal Embedding of Complete Binary Trees into Lines and Grids. |
WG |
1991 |
DBLP DOI BibTeX RDF |
|
12 | Olga Bolívar Toledo, Santiago Candela Solá, Roberto Moreno-Díaz |
Complete Transforms and Their Incidence in Artificial Perception Systems Theory. |
EUROCAST |
1991 |
DBLP DOI BibTeX RDF |
|
12 | Gerald E. Peterson |
Complete Sets of Reductions with Constraints. |
CADE |
1990 |
DBLP DOI BibTeX RDF |
|
12 | Per Grape |
Complete Problems With L-samplable Distributions. |
SWAT |
1990 |
DBLP DOI BibTeX RDF |
|
12 | Ryszard Janicki, Tomasz Müldner |
Complete Sequential Specification Allows for Concurrent Execution. |
ACM Conference on Computer Science |
1989 |
DBLP DOI BibTeX RDF |
|
12 | Volker Diekert |
Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
12 | Li-Yan Yuan, Ding-An Chiang |
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values. |
SIGMOD Conference |
1988 |
DBLP DOI BibTeX RDF |
|
12 | Edward P. F. Chan, Alberto O. Mendelzon |
Answering queries on embedded-complete database schemes. |
J. ACM |
1987 |
DBLP DOI BibTeX RDF |
|