default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazumasa Oida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Kazumasa Oida
:
Information cascade final size distributions derived from urn models. Appl. Netw. Sci. 8(1): 30 (2023)- [c5]Geng Wang, Kazumasa Oida:
Tracking Drones with Manual Operation Representation. ICIT 2023: 167-172 - 2022
- [j13]Ryu Saeki, Leo Kitayama, Jun Koga, Makoto Shimizu, Kazumasa Oida:
Smishing Strategy Dynamics and Evolving Botnet Activities in Japan. IEEE Access 10: 114869-114884 (2022) - [d1]Kazumasa Oida:
Smishing in Japan. IEEE DataPort, 2022
- 2021
- [j12]Kazumasa Oida:
Bi-Polarization in Cascade Size Distributions. IEEE Access 9: 72867-72880 (2021) - 2020
- [j11]Yinan Pei, Kazumasa Oida:
Tracing Website Attackers by Analyzing Onion Routers' Log Files. IEEE Access 8: 133190-133203 (2020)
2010 – 2019
- 2019
- [j10]Kazumasa Oida:
Impact of network density on cascade size and community growth. Appl. Netw. Sci. 4(1): 29:1-29:17 (2019) - [j9]Kazumasa Oida, Kyota Okubo:
Adopter Community Formation Accelerated by Repeaters of Product Advertisement Campaigns. IEEE Trans. Comput. Soc. Syst. 6(1): 56-72 (2019) - 2017
- [j8]Kyota Okubo, Kazumasa Oida:
A Successful Advertising Strategy over Twitter. Comput. Inf. Sci. 10(3): 10-22 (2017) - 2015
- [j7]Kazumasa Oida:
Propagation of Low Variability in Video Traffic. J. Networks 10(8): 448-461 (2015)
2000 – 2009
- 2009
- [j6]Kazumasa Oida:
Detecting suspended video streams through variance-time analysis. IEEE Trans. Netw. Serv. Manag. 6(1): 56-63 (2009) - 2008
- [j5]Kazumasa Oida:
On the impact of QoS-sensitivity on correlation structures. Comput. Networks 52(2): 351-359 (2008) - 2004
- [j4]Kazumasa Oida, Shigeru Saito:
A packet-size aware adaptive routing algorithm for parallel transmission server systems. J. Parallel Distributed Comput. 64(1): 36-47 (2004) - 2003
- [j3]Kazumasa Oida:
The Birth and Death Processes of Hypercycle spirals. Adv. Complex Syst. 6(4): 515-536 (2003) - 2001
- [j2]Kazumasa Oida, K. Shinjo:
Characteristics of Deterministic Optimal Routing for Two Heterogeneous Parallel Servers. Int. J. Found. Comput. Sci. 12(6): 775-790 (2001) - [c4]Kazuma Wakabayashi, Kazumasa Oida, Shigeru Saito:
Performance evaluation of routing algorithms from the viewpoint of audio stream application users. CATA 2001: 334-337 - [c3]Kazumasa Oida, Jun Shiozaki, Shigeru Saito:
A Packet-size Aware Adaptive Routing Algorithm for Parallel Transmission Server Systems. IPDPS 2001: 71 - 2000
- [j1]Kazumasa Oida, Masatoshi Sekido:
ARS: an efficient agent-based routing system for QoS guarantees. Comput. Commun. 23(14-15): 1437-1447 (2000) - [c2]Kazumasa Oida, K. Shinjo:
Deterministic Optimal Routing for Two Heterogeneous Parallel Servers. ICDCS 2000: 46-53
1990 – 1999
- 1999
- [c1]Kazumasa Oida, K. Shinjo:
Characteristics of deterministic optimal routing for a simple traffic control problem. IPCCC 1999: 386-392
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-06-19 21:47 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:
