default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIzumi Takeuti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Izumi Takeuti, Tomoko Adachi:
Secret Sharing Scheme with Perfect Concealment. IACR Cryptol. ePrint Arch. 2023: 333 (2023)
2010 – 2019
- 2012
- [j4]Osamu Takaki, Izumi Takeuti
, Noriaki Izumi, Kôiti Hasida:
Workflows with Passbacks and Incremental Verification of Their Correctness. IEICE Trans. Inf. Syst. 95-D(4): 989-1002 (2012) - 2010
- [c11]Osamu Takaki, Izumi Takeuti, Noriaki Izumi, Kôiti Hasida:
Syntax and Semantics of Workflows That Include Passbacks. ICSEA 2010: 169-177
2000 – 2009
- 2008
- [j3]Kazuko Takahashi, Takao Sumitomo, Izumi Takeuti:
On Embedding a Qualitative Representation in a Two-Dimensional Plane. Spatial Cogn. Comput. 8(1-2): 4-26 (2008) - [c10]Osamu Takaki, Takahiro Seino, Izumi Takeuti, Noriaki Izumi, Koichi Takahashi:
Quality Improvement of Workflow Diagrams Based on Passback Flow Consistency. ICEIS (3-2) 2008: 351-359 - [c9]Osamu Takaki, Izumi Takeuti, Takahiro Seino, Noriaki Izumi, Koichi Takahashi:
Incremental Verification of Large ScaleWorkflows Based on Extended Correctness. ICSEA 2008: 478-487 - [c8]Osamu Takaki, Takahiro Seino, Izumi Takeuti, Noriaki Izumi, Koichi Takahashi:
Workflow Diagrams Based on Evidence Life Cycles. JCKBSE 2008: 145-154 - 2007
- [c7]Osamu Takaki, Takahiro Seino, Izumi Takeuti, Noriaki Izumi, Koichi Takahashi:
Verification Algorithm of Evidence Life Cycles in Extended UML Activity Diagrams. ICSEA 2007: 9 - 2004
- [c6]Izumi Takeuti:
Transition Systems over Continuous Time-Space. CCA 2004: 173-186 - 2001
- [c5]Masahiko Sato, Yukiyoshi Kameyama, Izumi Takeuti:
CAL: A Computer Assisted Learning System for Computation and Logic. EUROCAST 2001: 509-524 - 2000
- [c4]Izumi Takeuti:
Effective Fixed Point Theorem over a Non-computably Separable Metric Space. CCA 2000: 310-322 - [c3]Izumi Takeuti:
Pruning Terms for Principal Type Assignment. CATS 2000: 144-159
1990 – 1999
- 1998
- [j2]Izumi Takeuti:
An Axiomatic System of Parametricity. Fundam. Informaticae 33(4): 397-432 (1998) - [c2]Izumi Takeuti:
A Type Theory for Cyclic Strcture. Fuji International Symposium on Functional and Logic Programming 1998: 207-226 - 1997
- [c1]Izumi Takeuti:
An Axiomatic System of Parametricity. TLCA 1997: 354-372 - 1996
- [j1]Sachio Hirokawa, Yuichi Komori, Izumi Takeuti:
A reduction rule for Peirce formula. Stud Logica 56(3): 419-426 (1996)
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:57 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:
