The nonapproximability of OBDD minimization
Information and Computation
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Information and Computation
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Lower Bound Technique for Restricted Branching Programs and Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Some Notes on the Information Flow in Read-Once Branching Programs
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On uncertainty versus size in branching programs
Theoretical Computer Science
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Algorithms and heuristics in VLSI design
Experimental algorithmics
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
On the design of problem-specific evolutionary algorithms
Advances in evolutionary computing
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
High-Performance QuIDD-Based Simulation of Quantum Circuits
Proceedings of the conference on Design, automation and test in Europe - Volume 2
Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On multi-partition communication complexity
Information and Computation
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Theoretical Computer Science
Information Processing Letters
Lower bounds for restricted read-once parity branching programs
Theoretical Computer Science
Data structures for symbolic multi-valued model-checking
Formal Methods in System Design
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Theoretical Computer Science - Mathematical foundations of computer science 2000
Theoretical Computer Science
A note on the decoding complexity of error-correcting codes
Information Processing Letters
Symbolic Model Checking for Channel-based Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
Minimization of decision trees is hard to approximate
Journal of Computer and System Sciences
The optimal read-once branching program complexity for the direct storage access function
Information Processing Letters
The decomposition tree for analyses of boolean functions
Mathematical Structures in Computer Science
Efficient pattern matching over event streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Checking Equivalence for Reo Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Redundancy-free residual dispatch: using ordered binary decision diagrams for efficient dispatch
Proceedings of the 7th workshop on Foundations of aspect-oriented languages
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Multi-state Directed Acyclic Graphs
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
Graph-Theoretic Concepts in Computer Science
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Evolutionary Computation
A direct construction of polynomial-size OBDD proof of pigeon hole problem
Information Processing Letters
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Journal of Artificial Intelligence Research
BDD-based synthesis of reversible logic for large functions
Proceedings of the 46th Annual Design Automation Conference
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
On multi-partition communication complexity
Information and Computation
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Information Processing Letters
Optimizing inference in Bayesian networks and semiring valuation algebras
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Extended BDD-based cryptanalysis of keystream generators
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Exact OBDD bounds for some fundamental functions
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the OBDD complexity of the most significant bit of integer multiplication
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Perfect hashing for state spaces in BDD representation
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Exponential space complexity for OBDD-based reachability analysis
Information Processing Letters
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
First CPIR protocol with data-dependent computation
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Two new efficient PIR-writing protocols
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Randomized OBDDs for the most significant bit of multiplication need exponential space
Information Processing Letters
Optimal adversary behavior for the serial model of financial attack trees
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Knowledge compilation meets database theory: compiling queries to decision diagrams
Proceedings of the 14th International Conference on Database Theory
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Randomized OBDDs for the most significant bit of multiplication need exponential size
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Almost k-wise independent sets establish hitting sets for width-3 1-branching programs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
Relational implementation of simple parallel evolutionary algorithms
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Behavioral technique for workflow abstraction and matching
BPM'06 Proceedings of the 4th international conference on Business Process Management
Reducing the space complexity of BDD-Based attacks on keystream generators
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
A larger lower bound on the OBDD complexity of the most significant bit of multiplication
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
BPEL behavioral abstraction and matching
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
The multiparty communication complexity of exact-T: improved bounds and new problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
PESSOA: a tool for embedded controller synthesis
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Embedding memoization to the semantic tree search for deciding QBFs
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
On the incompressibility of monotone DNFs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Genetic algorithms for the variable ordering problem of binary decision diagrams
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
RelView: an OBDD-based computer algebra system for relations
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
On the OBDD size for graphs of bounded tree- and clique-width
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
A relation-algebraic view on evolutionary algorithms for some graph problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A sufficient condition for sets hitting the class of read-once branching programs of width 3
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
An efficient implicit OBDD-Based algorithm for maximal matchings
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Implicit computation of maximum bipartite matchings by sublinear functional operations
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
The dichotomy of probabilistic inference for unions of conjunctive queries
Journal of the ACM (JACM)
BDD-Based Synthesis of Reversible Logic
International Journal of Applied Metaheuristic Computing
Specification-guided controller synthesis for linear systems and safe linear-time temporal logic
Proceedings of the 16th international conference on Hybrid systems: computation and control
Biconditional BDD: a novel canonical BDD for logic synthesis targeting XOR-rich circuits
Proceedings of the Conference on Design, Automation and Test in Europe
Priority functions for the approximation of the metric TSP
Information Processing Letters
A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
Information Processing Letters
| Hi-index | 0.01 |