ACM Computing Surveys (CSUR)
Feature-based similarity assessment of solid models
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Normal subgroup reconstruction and quantum computation using group representations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Shock Graphs and Shape Matching
International Journal of Computer Vision
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Comparing Structures Using a Hopfield-Style Neural Network
Applied Intelligence
Neural Networks and Structured Knowledge: Rule Extraction andApplications
Applied Intelligence
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
Graph-theoretical methods in computer vision
Theoretical aspects of computer science
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Graph-Theoretical Methods in Computer Vision
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A General Method for Graph Isomorphism
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Nonadaptive NC Checker for Permutation Group Intersection
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Completeness results for graph isomorphism
Journal of Computer and System Sciences
Theoretical Computer Science
The Complexity of Symmetry-Breaking Formulas
Annals of Mathematics and Artificial Intelligence
Efficient algorithms for checking the equivalence of multistage interconnection networks
Journal of Parallel and Distributed Computing
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas
Annals of Mathematics and Artificial Intelligence
New lattice-based cryptographic constructions
Journal of the ACM (JACM)
The complexity of Boolean matrix root computation
Theoretical Computer Science - Special papers from: COCOON 2003
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics
The complexity of equivalence and isomorphism of systems of equations over finite groups
Theoretical Computer Science - Mathematical foundations of computer science 2004
Complexities of homomorphism and isomorphism for definite logic programs
Journal of Computer Science and Technology
Information and Computation
Compatible topologies on graphs: an application to graph isomorphism problem complexity
Theoretical Computer Science
Complexity results in graph reconstruction
Discrete Applied Mathematics
Linear time algorithms for Abelian group isomorphism and related problems
Journal of Computer and System Sciences
The Decidability of the Structural Congruence for Beta-binders
Electronic Notes in Theoretical Computer Science (ENTCS)
On the asymmetric complexity of the group-intersection problem
Information Processing Letters
On the decidability and complexity of the structural congruence for beta-binders
Theoretical Computer Science
On the pseudo-achromatic number problem
Theoretical Computer Science
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Containment of conjunctive queries on annotated relations
Proceedings of the 12th International Conference on Database Theory
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics
Making Cryptographic Primitives Harder
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Computational complexity of computing a partial solution for the Graph Automorphism problems
Theoretical Computer Science
On the Complexity of Matroid Isomorphism Problems
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
SymChaff: a structure-aware satisfiability solver
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
Linear and Sublinear Time Algorithms for Basis of Abelian Groups
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient kernels for sentence pair classification
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Focused identification of process model changes
ICSP'07 Proceedings of the 2007 international conference on Software process
Reductions to graph isomorphism
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Isomorphism and canonization of tournaments and hypertournaments
Journal of Computer and System Sciences
A logspace algorithm for partial 2-tree canonization
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
From invariants to canonization in parallel
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Indexing tree and subtree by using a structure network
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Journal of Combinatorial Theory Series A
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Relational Graph Mining for Learning Events from Video
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
A polynomial algorithm for submap isomorphism of general maps
Pattern Recognition Letters
Applications of dimensionality reduction and exponential sums to graph automorphism
Theoretical Computer Science
Object categorization using bone graphs
Computer Vision and Image Understanding
Linear and sublinear time algorithms for the basis of abelian groups
Theoretical Computer Science
Physically-motivated dynamical algorithms for the graph isomorphism problem
Quantum Information & Computation
Quantum measurements for hidden subgroup problems with optimal sample complexity
Quantum Information & Computation
How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
Quantum Information & Computation
A graph-based fuzzy linguistic metadata schema for describing spatial relationships
Proceedings of the 2011 Visual Information Communication - International Symposium
Isomorphism of (mis)labeled graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
The complexity of game isomorphism
Theoretical Computer Science
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Detecting and breaking symmetries by reasoning on problem specifications
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Computational indistinguishability between quantum states and its cryptographic application
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Finding consistent categorial grammars of bounded value: a parameterized approach
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Process model difference analysis for supporting process evolution
EuroSPI'06 Proceedings of the 13th European conference on Software Process Improvement
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On isomorphism and canonization of tournaments and hypertournaments
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Theoretical Computer Science
Efficient Graph Kernels for Textual Entailment Recognition
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
On the complexity of game isomorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hardness results for tournament isomorphism and automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Relating complete and partial solution for problems similar to graph automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Connecting the rationale for changes to the evolution of a process
PROFES'07 Proceedings of the 8th international conference on Product-Focused Software Process Improvement
Maintaining a large process model aligned with a process standard: an industrial example
EuroSPI'07 Proceedings of the 14th European conference on Software Process Improvement
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
On the resolution complexity of graph non-isomorphism
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
The Graph Isomorphism Problem and approximate categories
Journal of Symbolic Computation
G-Tries: a data structure for storing and finding subgraphs
Data Mining and Knowledge Discovery
| Hi-index | 0.01 |