default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitri Boulytchev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Eridan Domoratskiy, Dmitry Boulytchev:
A Relational Solver for Constraint-based Type Inference. CoRR abs/2408.17138 (2024)- 2023
- [c14]Peter Lozov
, Dmitry Kosarev, Dmitry Ivanov, Dmitry Boulytchev:
Relational Solver for Java Generics Type System. LOPSTR 2023: 118-128 - 2022
- [c13]Dmitry Rozplokhas, Dmitry Boulytchev:
Scheduling Complexity of Interleaving Search. FLOPS 2022: 152-170 - [c12]Daniil Berezun, Dmitry Boulytchev:
Reimplementing the Wheel: Teaching Compilers with a Small Self-Contained One. TFPIE 2022: 22-43 - [i4]Dmitry Rozplokhas, Dmitry Boulytchev:
Scheduling Complexity of Interleaving Search. CoRR abs/2202.08511 (2022) - 2021
- [c11]Peter Lozov, Dmitry Boulytchev:
Efficient fair conjunction for structurally-recursive relations. PEPM@POPL 2021: 58-73 - [c10]Ekaterina Verbitskaia, Daniil Berezun, Dmitry Boulytchev:
An Empirical Study of Partial Deduction for miniKanren. VPT@ETAPS 2021: 73-94 - [i3]Dmitry Kosarev, Dmitry Boulytchev:
Generic Programming with Combinators and Objects. CoRR abs/2106.01250 (2021) - 2020
- [c9]Dmitry Rozplokhas, Andrey Vyatkin, Dmitry Boulytchev:
Certified Semantics for Relational Programming. APLAS 2020: 167-185 - [c8]Dmitry Kosarev, Petr Lozov, Dmitry Boulytchev:
Relational Synthesis for Pattern Matching. APLAS 2020: 293-310 - [i2]Dmitry Rozplokhas, Andrey Vyatkin, Dmitry Boulytchev:
Certified Semantics for Relational Programming. CoRR abs/2005.01018 (2020)
2010 – 2019
- 2018
- [c7]Dmitri Rozplokhas, Dmitri Boulytchev:
Improving Refutational Completeness of Relational Search via Divergence Test. PPDP 2018: 18:1-18:13 - [i1]Dmitri Boulytchev:
Code Reuse With Transformation Objects. CoRR abs/1802.01930 (2018) - 2017
- [c6]Petr Lozov, Andrei Vyatkin, Dmitry Boulytchev:
Typed Relational Conversion. TFP 2017: 39-58 - 2016
- [c5]Dmitry Kosarev, Dmitry Boulytchev:
Typed Embedding of a Relational Language in OCaml. ML/OCAML 2016: 1-22 - 2015
- [j1]Dmitry Boulytchev:
Combinators and type-driven transformers in Objective Caml. Sci. Comput. Program. 114: 57-73 (2015) - 2014
- [c4]Anton Podkopaev, Dmitri Boulytchev:
Polynomial-Time Optimal Pretty-Printing Combinators with Choice. Ershov Memorial Conference 2014: 257-265 - 2010
- [c3]Dmitri Boulytchev, Oleg S. Medvedev:
Hardware description language based on message passing and implicit pipelining. EWDTS 2010: 438-441
2000 – 2009
- 2006
- [c2]Dmitri Boulytchev:
BURS-Based Instruction Set Selection. Ershov Memorial Conference 2006: 431-437 - 2001
- [c1]Dmitri Boulytchev, Dmitry Lomov:
An Empirical Study of Retargetable Compilers. Ershov Memorial Conference 2001: 328-335
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-09-30 00:08 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:
