Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Alexandre Ja. Dikovsky

dblp:60/452 · also Alexander Ja. Dikovsky · DBLP profile ↗
← Back
16ranked-venue papers
5as first author
0since 2021 · last 2015
0000-0003-0990-5095ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 15 · 4 first-authorArtificial intelligence and machine learning · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Automata and formal languages · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › grammar formalisms
dependency grammar		 0.012001
Grammars for Local and Long Dependencies · ACL 2001
Automata and formal languages › parsing
discontinuous constituency parsing		 0.012001
Grammars for Local and Long Dependencies · ACL 2001
Automata and formal languages
grammar formalisms		 0.012001
Grammars for Local and Long Dependencies · ACL 2001
Automata and formal languages
parsing		 0.012001
Grammars for Local and Long Dependencies · ACL 2001
Automata and formal languages
context-free languages		 0.011977
On Three Types of Unambiguity of Context-Free Languages · ICALP 1977
Automata and formal languages › context-free languages
unambiguity		 0.011977
On Three Types of Unambiguity of Context-Free Languages · ICALP 1977

Methods — techniques the papers use, named apart from their topics

polarized dependency grammars · 0.0
YearPublicationVenuePosition
2015 Categorial dependency grammars
Michael I. Dekhtyar, Alexandre Ja. Dikovsky, Boris Karlov
 Theor. Comput. Sci.2
2012 Categorial grammars with iterated types form a strict hierarchy of k-valued languages
Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret
 Theor. Comput. Sci.2
2011 Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages
Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret
 CIAA2
2008 Optional and Iterated Types for Pregroup Grammars
Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret, Emmanuelle Garel
 LATA2
2007 A Finite-State Functional Grammar Architecture
Alexandre Ja. Dikovsky
 WoLLIC1
2006 On complexity of verification of interacting agents' behavior
Michael I. Dekhtyar, Alexandre Ja. Dikovsky, Mars K. Valiev
 Ann. Pure Appl. Log.2
2003 On feasible cases of checking multi-agent systems behavior
Michael I. Dekhtyar, Alexandre Ja. Dikovsky, Mars K. Valiev
 Theor. Comput. Sci.2
2002 Complexity of Multi-agent Systems Behavior
Michael I. Dekhtyar, Alexandre Ja. Dikovsky, Mars K. Valiev
 JELIA2
2001 Grammars for Local and Long Dependencies
abstract
Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous constructions. PD-grammars describe two kinds of dependencies: local, explicitly derived by the rules, and long, implicitly specified by negative and positive valencies of words. If in a PD-grammar the number of non-saturated valencies in derived structures is bounded by a constant, then it is weakly equivalent to a cf-grammar and has a O(n3)-time parsing algorithm. It happens that such bounded PD-grammars are strong enough to express such phenomena as unbounded raising, extraction and extraposition.
Alexandre Ja. Dikovsky
 ACL1
1999 Monotone Expansion of Updates in Logical Databases
Michael I. Dekhtyar, Alexandre Ja. Dikovsky, Sergey M. Dudakov, Nicolas Spyratos
 LPNMR2
1997 Total Homeostaticity and Integrity Constraints Restorability Recognition
Michael I. Dekhtyar, Alexandre Ja. Dikovsky
 ICLP2
1997 On Conservative Enforced Updates
Michael I. Dekhtyar, Alexandre Ja. Dikovsky, Nicolas Spyratos
 LPNMR2
1995 Dynamic Deductive Data Bases With Steady Behaviour
Michael I. Dekhtyar, Alexandre Ja. Dikovsky
 ICLP2
1993 On the Computational Complexity of Prolog Programs
Alexandre Ja. Dikovsky
 Theor. Comput. Sci.1
1977 On Three Types of Unambiguity of Context-Free Languages
Alexandre Ja. Dikovsky, Larisa S. Modina
 ICALP1
1975 On Closure Properties of Context-Free Derivation Complexity Classes
Alexandre Ja. Dikovsky
 MFCS1