Takumi Kasai

From MaRDI portal
Person:1102115

Available identifiers

zbMath Open kasai.takumiMaRDI QIDQ1102115

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q54054702014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q45053702000-09-27Paper
Spinal-formed context-free tree grammars2000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49378532000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q42533431999-11-08Paper
The Othello game on an \(n\times n\) board is PSPACE-complete1994-02-22Paper
Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines1993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42064031990-01-01Paper
Simultaneous (poly-time, log-space) lower bounds1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859411987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859501987-01-01Paper
A note on some simultaneous relations among time, space, and reversal for single work tape nondeterministic turing machines1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38026091986-01-01Paper
Gradually intractable problems and nondeterministic log-space lower bounds1985-01-01Paper
Some combinatorial game problems require Ω( n k ) time1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32176021984-01-01Paper
Homomorphisms between models of parallel computation1982-01-01Paper
Space complexity in on-line computation1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39070701981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39579461981-01-01Paper
A characterization of time complexity by simple loop programs1980-01-01Paper
Classes of Pebble Games and Complete Problems1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39070461979-01-01Paper
Computational complexity of multitape Turing machines and random access machines1977-01-01Paper
A universal context-free grammar1975-01-01Paper
Translatability of flowcharts into while programs1974-01-01Paper
Covering-languages of grammars1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56499851971-01-01Paper
A hierarchy between context-free and context-sensitive languages1970-01-01Paper

Research outcomes over time

This page was built for person: Takumi Kasai