Alexei P. Stolboushkin

Publication Activity (10 Years)

Years Active: 1983-2007
Publications (10 Years): 0

Publications

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