Citations per year, relative to Osamu Watanabe Osamu Watanabe (= 1×)
peers
Gregory D. Peterson
Countries citing papers authored by Osamu Watanabe
Since
Specialization
Citations
This map shows the geographic impact of Osamu Watanabe's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Osamu Watanabe with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Osamu Watanabe more than expected).
This network shows the impact of papers produced by Osamu Watanabe. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Osamu Watanabe. The network helps show where Osamu Watanabe may publish in the future.
Co-authorship network of co-authors of Osamu Watanabe
This figure shows the co-authorship network connecting the top 25 collaborators of Osamu Watanabe.
A scholar is included among the top collaborators of Osamu Watanabe based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Osamu Watanabe. Osamu Watanabe is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Asano, Tetsuo, et al.. (2014). O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem.. Electronic colloquium on computational complexity. 21. 71.1 indexed citations
4.
Kane, Daniel M. & Osamu Watanabe. (2013). A Short Implicant of CNFs with Relatively Many Satisfying Assignments.. Electronic colloquium on computational complexity. 20. 176.
5.
Kabanets, Valentine & Osamu Watanabe. (2011). Is the Valiant-Vazirani Isolation Lemma Improvable?. Electronic colloquium on computational complexity. 18. 151.2 indexed citations
Wang, Tong, et al.. (2011). A 55-to-67GHz Power Amplifier with 13.6% PAE in 65nm standard CMOS. IEICE Technical Report; IEICE Tech. Rep.. 111(242). 113–118.2 indexed citations
Watanabe, Osamu, et al.. (2006). A Simple Message Passing Algorithm for Graph Partitioning. Chalmers Publication Library (Chalmers University of Technology).1 indexed citations
10.
Yoshida, Hiroshi, et al.. (2004). Fully Differential Direct-Conversion Receiver for W-CDMA Reducing DC-Offset Variation. IEICE Transactions on Electronics. 87(6). 901–908.2 indexed citations
11.
Watanabe, Osamu, et al.. (2003). A 380-MHz CMOS Linear-in-dB Variable Gain Amplifier with Gain Compensation Techniques for CDMA Systems. IEICE Transactions on Electronics. 86(6). 1069–1076.2 indexed citations
Domingo, Carlos & Osamu Watanabe. (2000). MadaBoost: A Modification of AdaBoost. Tokyo Tech Research Repository (Tokyo Institute of Technology). 180–189.109 indexed citations
14.
Mochizuki, Atsushi, et al.. (1996). On a Positive Instance Generation for the 3-Satisfiability (3SAT) Problem. 96(95). 9–16.1 indexed citations
15.
Watanabe, Osamu, et al.. (1994). Weed Emergence Pattern in Vegetable Garden. 31(2). 145–151.
16.
Watanabe, Osamu, et al.. (1990). Heat transfer of a gas and liquid two-phase flow in helical coiled tubes. Heat Transfer. 19(5). 492–506.1 indexed citations
17.
Watanabe, Osamu. (1988). On <=^P_{1-tt}-Sparseness and Nondeterministic Complexity Classes (Extended Abstract). International Colloquium on Automata, Languages and Programming. 697–709.3 indexed citations
18.
Watanabe, Osamu. (1987). Polynomial time reducibility to a set of small density..10 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.