The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Information and Computation
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Lower bounds for linearly transformed OBDDs and FBDDs
Journal of Computer and System Sciences
Multiparty Communication Complexity: Very Hard Functions
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Towards Regular Languages over Infinite Alphabets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Note on Minimal Finite Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
On the Power of Las Vegas II. Two-Way Finite Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximations by OBDDs and the Variable Ordering Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
STACS '00 Proceedings of the 17th 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
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Eliminating Communication by Parallel Rewriting
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Information Processing Letters
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Journal of Computer and System Sciences
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
On multi-partition communication complexity
Information and Computation
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
On the power of randomized multicounter machines
Theoretical Computer Science - Insightful theory
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
Information Processing Letters
Comparing the size of NFAs with and without ε-transitions
Theoretical Computer Science
Transition complexity of language operations
Theoretical Computer Science
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
A note on the size of OBDDs for the graph of integer multiplication
Information Processing Letters
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Theoretical Computer Science
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
On multi-partition communication complexity
Information and Computation
Information Processing Letters
On the separation between k-party and (k - 1)-party nondeterministic message complexities
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
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
On probabilistic pushdown automata
Information and Computation
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
A Communication Approach to the Superposition Problem
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Larger lower bounds on the OBDD complexity of integer multiplication
Information and Computation
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
On the OBDD complexity of the most significant bit of integer multiplication
Theoretical Computer Science
Rainbow of computer science
Comparing necessary conditions for recognizability of two-dimensional languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On separating constant from polynomial ambiguity of finite automata
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
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
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Lower bounds on the OBDD size of graphs of some popular functions
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
NOF-multiparty information complexity bounds for pointer jumping
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Algorithmics – is there hope for a unified theory?
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
An infinite hierarchy of languages defined by dP systems
Theoretical Computer Science
dP automata versus right-linear simple matrix grammars
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Robotic clusters: Multi-robot systems as computer clusters
Robotics and Autonomous Systems
Trade-Offs Between Time, Space, Cooperation, and Communication Complexity for CD Grammar Systems
Fundamenta Informaticae
Fundamenta Informaticae
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
Multiparty communication complexity of vector---valued and sum---type functions
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.01 |