default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexei P. Stolboushkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[c12]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
1990 – 1999
- 1999
- [j10]Alexei P. Stolboushkin, Michael A. Taitslin:
Normalizable linear orders and generic computations in finite models. Arch. Math. Log. 38(4-5): 257-271 (1999) - [j9]Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin:
Extended Order-Generic Queries. Ann. Pure Appl. Log. 97(1-3): 85-125 (1999) - [j8]Alexei P. Stolboushkin, Michael A. Taitslin:
Finite Queries Do Not Have Effective Syntax. Inf. Comput. 153(1): 99-116 (1999) - 1998
- [j7]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
- [j6]A. J. Kfoury, Alexei P. Stolboushkin:
An Infinite Pebble Game and Applications. Inf. Comput. 136(1): 53-66 (1997) - [j5]Alexei P. Stolboushkin, Damian Niwinski:
y = 2x vs. y = 3x. J. Symb. Log. 62(2): 661-672 (1997) - [c11]Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin:
Generic Queries over Quasy-o-minimal Domains. LFCS 1997: 21-32 - 1996
- [c10]Alexei P. Stolboushkin, Michael A. Taitslin:
Linear vs. Order Contstrained Queries Over Rational Databases. PODS 1996: 17-27 - 1995
- [c9]Alexei P. Stolboushkin:
Finitely Monotone Properties. LICS 1995: 324-330 - [c8]Alexei P. Stolboushkin:
Towards Recursive Model Theory. Logic Colloquium 1995: 325-338 - [c7]Alexei P. Stolboushkin, Michael A. Taitslin:
Finite Queries do not Have Effective Syntax. PODS 1995: 277-285 - 1994
- [c6]Alexei P. Stolboushkin, Michael A. Taitslin:
Is First Order Contained in an Initial Segment of PTIME? CSL 1994: 242-248 - 1993
- [c5]Damian Niwinski, Alexei P. Stolboushkin:
y = 2x vs. y = 3x. LICS 1993: 172-178 - 1992
- [j4]Alexei P. Stolboushkin:
On the Computing Power of Programs with Sets. Int. J. Found. Comput. Sci. 3(2): 161-186 (1992) - [c4]Alexei P. Stolboushkin:
Axiomatizable Classes of Finite Models and Definability of Linear Order. LICS 1992: 64-70 - 1990
- [c3]Alexei P. Stolboushkin:
On the expressive power of program schemes with sets. Jerusalem Conference on Information Technology 1990: 447-455
1980 – 1989
- 1989
- [c2]Alexei P. Stolboushkin:
Some Complexity Bounds for Dynamic Logics. LICS 1989: 324-332 - 1988
- [c1]Alexei P. Stolboushkin:
Flow-diagrams with sets. Conference on Computer Logic 1988: 286-299 - 1983
- [j3]Alexei P. Stolboushkin, Michael A. Taitslin:
Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic. Inf. Control. 57(1): 48-55 (1983) - [j2]Alexei P. Stolboushkin:
Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic. Inf. Control. 59(1-3): 94-107 (1983) - [j1]Alexei P. Stolboushkin, Michael A. Taitslin:
The Comparison of the Expressive Power of First-Order Dynamic Logics. Theor. Comput. Sci. 27: 197-209 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
