| 2007 |
|---|
| 20 | EE | 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: 223-230 |
| 1999 |
|---|
| 19 | | Oleg V. Belegradek,
Alexei P. Stolboushkin,
Michael A. Taitslin:
Extended Order-Generic Queries.
Ann. Pure Appl. Logic 97(1-3): 85-125 (1999) |
| 18 | EE | Alexei P. Stolboushkin,
Michael A. Taitslin:
Normalizable linear orders and generic computations in finite models.
Arch. Math. Log. 38(4-5): 257-271 (1999) |
| 17 | | Alexei P. Stolboushkin,
Michael A. Taitslin:
Finite Queries Do Not Have Effective Syntax.
Inf. Comput. 153(1): 99-116 (1999) |
| 1998 |
|---|
| 16 | EE | Alexei P. Stolboushkin,
Michael A. Taitslin:
Safe Stratified Datalog with Integer Order Does Not Have Syntax.
ACM Trans. Database Syst. 23(1): 100-109 (1998) |
| 1997 |
|---|
| 15 | | Oleg V. Belegradek,
Alexei P. Stolboushkin,
Michael A. Taitslin:
Generic Queries over Quasy-o-minimal Domains.
LFCS 1997: 21-32 |
| 14 | | A. J. Kfoury,
Alexei P. Stolboushkin:
An Infinite Pebble Game and Applications.
Inf. Comput. 136(1): 53-66 (1997) |
| 13 | | Alexei P. Stolboushkin,
Damian Niwinski:
y = 2x vs. y = 3x.
J. Symb. Log. 62(2): 661-672 (1997) |
| 1996 |
|---|
| 12 | EE | Alexei P. Stolboushkin,
Michael A. Taitslin:
Linear vs. Order Contstrained Queries Over Rational Databases.
PODS 1996: 17-27 |
| 1995 |
|---|
| 11 | | Alexei P. Stolboushkin:
Finitely Monotone Properties
LICS 1995: 324-330 |
| 10 | EE | Alexei P. Stolboushkin,
Michael A. Taitslin:
Finite Queries do not Have Effective Syntax.
PODS 1995: 277-285 |
| 1994 |
|---|
| 9 | | Alexei P. Stolboushkin,
Michael A. Taitslin:
Is First Order Contained in an Initial Segment of PTIME?
CSL 1994: 242-248 |
| 1993 |
|---|
| 8 | | Damian Niwinski,
Alexei P. Stolboushkin:
y = 2x vs. y = 3x
LICS 1993: 172-178 |
| 1992 |
|---|
| 7 | | Alexei P. Stolboushkin:
Axiomatizable Classes of Finite Models and Definability of Linear Order
LICS 1992: 64-70 |
| 6 | | Alexei P. Stolboushkin:
On the Computing Power of Programs with Sets.
Int. J. Found. Comput. Sci. 3(2): 161-186 (1992) |
| 1989 |
|---|
| 5 | | Alexei P. Stolboushkin:
Some Complexity Bounds for Dynamic Logics
LICS 1989: 324-332 |
| 1988 |
|---|
| 4 | | Alexei P. Stolboushkin:
Flow-diagrams with sets.
Conference on Computer Logic 1988: 286-299 |
| 1983 |
|---|
| 3 | | Alexei P. Stolboushkin,
Michael A. Taitslin:
Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic
Information and Control 57(1): 48-55 (1983) |
| 2 | | Alexei P. Stolboushkin:
Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic
Information and Control 59(1-3): 94-107 (1983) |
| 1 | | Alexei P. Stolboushkin,
Michael A. Taitslin:
The Comparison of the Expressive Power of First-Order Dynamic Logics.
Theor. Comput. Sci. 27: 197-209 (1983) |
