Alexei P. Stolboushkin

According to our database1, Alexei P. Stolboushkin authored at least 20 papers between 1983 and 2007.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2007
Multiple-signal duplicate detection for search evaluation.
Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007

1999
Finite Queries Do Not Have Effective Syntax.
Inf. Comput., 1999

Extended Order-Generic Queries.
Ann. Pure Appl. Log., 1999

Normalizable linear orders and generic computations in finite models.
Arch. Math. Log., 1999

1998
Safe Stratified Datalog with Integer Order Does Not Have Syntax.
ACM Trans. Database Syst., 1998

1997
y = 2x vs. y = 3x.
J. Symb. Log., 1997

An Infinite Pebble Game and Applications.
Inf. Comput., 1997

Generic Queries over Quasy-o-minimal Domains.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996
Linear vs. Order Contstrained Queries Over Rational Databases.
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

1995
Towards Recursive Model Theory.
Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

Finitely Monotone Properties
Proceedings of the Proceedings, 1995

1994
Is First Order Contained in an Initial Segment of PTIME?
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1992
On the Computing Power of Programs with Sets.
Int. J. Found. Comput. Sci., 1992

Axiomatizable Classes of Finite Models and Definability of Linear Order
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1990
On the expressive power of program schemes with sets.
Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990

1989
Some Complexity Bounds for Dynamic Logics
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
Flow-diagrams with sets.
Proceedings of the COLOG-88, 1988

1983
Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic
Inf. Control., April, 1983

The Comparison of the Expressive Power of First-Order Dynamic Logics.
Theor. Comput. Sci., 1983

Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic
Inf. Control., 1983


  Loading...