| 発行日 | タイトル |
著者 |
|---|
| Aug-2004 | On Anonymity Metrics for Practical Anonymous Communication Protocols | Kitazawa, Shigeki; Soshi, Masakazu; Miyaji, Atsuko |
| 2012 | On bipartite powers of bigraphs | Okamoto, Yoshio; Otachi, Yota; Uehara, Ryuhei |
| Oct-2007 | On Computing Longest Paths in Small Graph Classes | Uehara, Ryuhei; Uno, Yushi |
| Sep-2005 | On constructing completions | Crosilla, Laura; Ishihara, Hajime; Schuster, Peter |
| Jul-2009 | On convergence constrained precoder design for iterative frequency domain MIMO detector | Karjalainen, Juha; Tolli, Antti; Matsumoto, Tad; Juntti, Markku |
| Nov-2012 | On convergence constraint precoder design for iterative frequency domain multiuser SISO detector | Tervo, Valtteri; Tolli, A; Karjalainen, J.; Matsumoto, Tad |
| 2011 | On covering of any point configuration by disjoint unit disks | Okayama, Yosuke; Kiyomi, Masashi; Uehara, Ryuhei |
| 1-May-2001 | On Detecting Digital Line Components in a Binary Image | ASANO, Tetsuo; OBOKATA, Koji; TOKUYAMA, Takeshi |
| 24-Nov-2006 | On domains and domain engineering : prerequisites for trustworthy software, a necessity for believable project management | Bjorner, Dines |
| 2004 | On Geometric Structure of Global Roundings for Graphs and Range Spaces | Asano, Tetsuo; Katoh, Naoki; Tamaki, Hisao; Tokuyama, Takeshi |
| 6-Dec-2010 | On Greedy Methods for EXIT Chart Based Transmission Power Allocation | Karjalainen, Juha; Codreanu, Marian; Tolli, Antti; Juntti, Markku; Matsumoto, Tad |
| 15-Feb-1993 | On monotone undirected contact networks computing T^n_<n-1> | Halldorsson, Magnus; Radhakrishnan, Jaikumar; Subrahmanyam, K.V. |
| 30-Jun-2016 | On principles between ∑1- and ∑2-induction, and monotone enumerations | Kreuzer, Alexander P.; Yokoyama, Keita |
| 26-Oct-1998 | On proving Ac-termination by AC-dependency pairs | Kusakari, Keiichirou; Toyama, Yoshihito |
| 23-Mar-1999 | On proving AC-termination by argument filtering method | Kusakari, Keiichirou; Toyama, Yoshihito |
| Apr-1994 | On Secure and Fast Elliptic Curve Cryptosystems over F_p | MIYAJI, Atsuko |
| 2-Jun-1997 | On solving the max-min 0-1 knapsack problem | Iida, Hiroshi |
| 2-Jul-1996 | On some evolutionary implications of the genetic code | Maeshiro, Tetsuya; Kimura, Masayuki; 真栄城, 哲也; 木村, 正行; マエシロ, テツヤ; キムラ, マサユキ |
| 18-Oct-1996 | On structural properties of genetic codes with high adaptability and robustness | Maeshiro, Tetsuya; Kimura, Masayuki; 真栄城, 哲也; 木村, 正行; マエシロ, テツヤ; キムラ, マサユキ |
| 16-Nov-1993 | On the complexity of negation-limited Boolean networks | Tanaka, Keisuke; Nishino, Tetsuro; 田中, 圭介; 西野, 哲朗; タナカ, ケイスケ; ニシノ, テツロウ |
| 14-Dec-2010 | On the complexity of reconfiguration problems | Ito, Takehiro; Demaine, Erik D.; Harvey, Nicholas J.A.; Papadimitriou, Christos H.; Sideri, Martha; Uehara, Ryuhei; Uno, Yushi |
