( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Zephyr: Toward true compiler-based programming in Prolog.

, , , , и . IBM J. Res. Dev., 36 (3): 391-408 (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Hiroaki Kobayashi

Hiroaki Tanaka

 

Другие публикации лиц с тем же именем

Zephyr: Toward true compiler-based programming in Prolog., , , , и . IBM J. Res. Dev., 36 (3): 391-408 (1992)Topological routing path search algorithm with incremental routability test., и . ASP-DAC, стр. 645-648. IEEE, (1997)Study of non-contact nano-probing technique using FIB., , , , и . Microelectron. Reliab., 50 (9-11): 1451-1453 (2010)Network-Based Problem Detection for Distributed Systems., , , , , , и . ICDE, стр. 978-989. IEEE Computer Society, (2005)Curvilinear detailed routing with simultaneous wire-spreading and wire-fattening., и . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 18 (11): 1646-1653 (1999)Topological routing path search algorithm with incremental routability test., и . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 18 (2): 142-150 (1999)Finding a Connection Chain for Tracing Intruders., и . ESORICS, том 1895 из Lecture Notes in Computer Science, стр. 191-205. Springer, (2000)Introduction of a Package System into Prolog., , , , и . LP, том 315 из Lecture Notes in Computer Science, стр. 105-112. Springer, (1987)Protecting from stack-smashing attacks, и . (2000)Published on World-Wide Web at URL http://www.trl.ibm.com/projects/security/ssp/main.html.Curvilinear Detailed Routing Algorithm and Its Extension to Wire-Spreading and Wire-Fattening., и . ASP-DAC, стр. 385-390. IEEE, (1998)