IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
SS 2022-03-07
14:05		 Online Online reversible debugging for a parallel programming language by contract annotations
Takashi Ikeda, Shoji Yuen (Nagoya Univ.) SS2021-48		 We present a reversible debugger for parallel programs with block structures. We propose a reversible debugging method b... [more] SS2021-48
pp.37-42
SS 2020-03-04
15:10		 Okinawa
(Cancelled but technical report was issued)		 Transforming Programs with Exclusive Control into Logically Constrained Term Rewrite Systems
Misaki Kojima, Naoki Nishida, Yutaka Matsubara, Masahiko Sakai (Nagoya Univ.) SS2019-46		 To apply Logically Constrained Term Rewrite Systems (LCTRSs, for short) to program verification, a previous work targets... [more] SS2019-46
pp.31-36
MoNA, AN, USN
(Joint)		 2013-01-24
11:30		 Miyagi ICHINOBO (Sendai-city) Higher Concurrent and Reliable Wireless Ad-Hoc Communication by Uni-Directional FEC
Yuta Nakagawa, Hiroaki Higaki (Tokyo Denki Univ.) AN2012-51		 In an unreliable wireless networks, there are two reliable communication methods BEC (Backward Error Correction) with an... [more] AN2012-51
pp.43-48
ISEC, SITE, IPSJ-CSEC 2006-07-21
10:45		 Okayama Okayama Univ. Asymptotic Lower Bound on Round Complexity of Bounded Concurrent Black-Box Zero-Knowledge Proof Protocols
Hirofumi Muratani (Toshiba) 		We derive a lower bound on the round complexity of an $m$-bounded concurrent black-box zero-knowledge interactive proof ... [more] ISEC2006-43
pp.19-26
DE 2006-07-14
10:25		 Niigata HOTEL SENKEI A Concurrency Control Method Using the B-link on the Fat-Btree
Tomohiro Yoshihara, Dai Kobayashi (Tokyo Tech), Ryo Taguchi (NHK), Haruo Yokota (Tokyo Tech) 		The B-link can achieve excellent concurrency control, which uses links to chain all nodes at each level together. In the... [more] DE2006-110
pp.109-114
ISEC 2006-05-19
16:10		 Tokyo Kikai-Shinko-Kaikan Bldg. General Composition of a Bounded Concurrent Black-Box Zero-Knowledge Protocol
Hirofumi Muratani (TOSHIBA) 		We consider the round-complexity of an $m$-bounded concurrent black-box zero-knowledge interactive proof protocol. In th... [more] ISEC2006-7
pp.45-52
 Results 1 - 6 of 6  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan