Alexei P. Stolboushkin

22 papers A* 7B 1Misc 1Journal 10Unranked 3
YearRankTypeTitle / Venue / Authors
2007 A* conf
Multiple-signal duplicate detection for search evaluation.
SIGIR
Scott B. Huffman, April Rasala Lehman, Alexei P. Stolboushkin, Howard Wong-Toi, Fan Yang, Hein Röhrig
1999 J jnl
Extended Order-Generic Queries.
Ann. Pure Appl. Log.
Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin
1999 J jnl
Finite Queries Do Not Have Effective Syntax.
Inf. Comput.
Alexei P. Stolboushkin, Michael A. Taitslin
1999 J jnl
Normalizable linear orders and generic computations in finite models.
Arch. Math. Log.
Alexei P. Stolboushkin, Michael A. Taitslin
1998 J jnl
Safe Stratified Datalog with Integer Order Does Not Have Syntax.
ACM Trans. Database Syst.
Alexei P. Stolboushkin, Michael A. Taitslin
1997 J jnl
An Infinite Pebble Game and Applications.
Inf. Comput.
A. J. Kfoury, Alexei P. Stolboushkin
1997 Misc conf
Generic Queries over Quasy-o-minimal Domains.
LFCS
Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin
1997 J jnl
y = 2x vs. y = 3x.
J. Symb. Log.
Alexei P. Stolboushkin, Damian Niwinski
1996 A* conf
Linear vs. Order Contstrained Queries Over Rational Databases.
PODS
Alexei P. Stolboushkin, Michael A. Taitslin
1995 A* conf
Finite Queries do not Have Effective Syntax.
PODS
Alexei P. Stolboushkin, Michael A. Taitslin
1995 A* conf
Finitely Monotone Properties
LICS
Alexei P. Stolboushkin
1995 — conf
Towards Recursive Model Theory.
Logic Colloquium
Alexei P. Stolboushkin
1994 B conf
Is First Order Contained in an Initial Segment of PTIME?
CSL
Alexei P. Stolboushkin, Michael A. Taitslin
1993 A* conf
y = 2x vs. y = 3x
LICS
Damian Niwinski, Alexei P. Stolboushkin
1992 A* conf
Axiomatizable Classes of Finite Models and Definability of Linear Order
LICS
Alexei P. Stolboushkin
1992 J jnl
On the Computing Power of Programs with Sets.
Int. J. Found. Comput. Sci.
Alexei P. Stolboushkin
1990 — conf
On the expressive power of program schemes with sets.
Jerusalem Conference on Information Technology
Alexei P. Stolboushkin
1989 A* conf
Some Complexity Bounds for Dynamic Logics
LICS
Alexei P. Stolboushkin
1988 — conf
Flow-diagrams with sets.
Conference on Computer Logic
Alexei P. Stolboushkin
1983 J jnl
Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic
Inf. Control.
Alexei P. Stolboushkin, Michael A. Taitslin
1983 J jnl
Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic
Inf. Control.
Alexei P. Stolboushkin
1983 J jnl
The Comparison of the Expressive Power of First-Order Dynamic Logics.
Theor. Comput. Sci.
Alexei P. Stolboushkin, Michael A. Taitslin