default search action
Jinsong Tan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Jinsong Tan, Anh Tuan Hoang:
Improvement Method of College Students' Physical Training Decision-Making Based on Fuzzy Analytic Hierarchy Process. Int. J. Web Based Learn. Teach. Technol. 19(1): 1-16 (2024) - 2023
- [j8]Jinsong Tan, Zhuguo Ran, Chunjiang Wan:
EEG signal recognition algorithm with sample entropy and pattern recognition. J. Comput. Methods Sci. Eng. 23(4): 2059-2068 (2023) - 2020
- [j7]Zhaoming Zhou
, Mian Qin, Yuedong Xie, Jinsong Tan
Experimental Study of Microstructures in Bias Weld of Coiled Tubing Steel Strip With Multi-Frequency Eddy Current Testing. IEEE Access 8: 48241-48251 (2020)
2010 – 2019
- 2019
- [j6]Zhaoming Zhou
Structural optimization and analysis of surface acoustic wave biosensor based on numerical method. Int. J. Distributed Sens. Networks 15(9) (2019) - 2010
- [c8]Jinsong Tan:
The Networked Common Goods Game. COCOA (2) 2010: 317-331 - [c7]Tanmoy Chakraborty, J. Stephen Judd, Michael J. Kearns, Jinsong Tan:
A behavioral study of bargaining in social networks. EC 2010: 243-252 - [i3]Jinsong Tan:
The Networked Common Goods Game. CoRR abs/1004.1578 (2010)
2000 – 2009
- 2009
- [j5]Michael J. Kearns, J. Stephen Judd, Jinsong Tan, Jennifer Wortman:
Behavioral experiments on biased voting in networks. Proc. Natl. Acad. Sci. USA 106(5): 1347-1352 (2009) - 2008
- [j4]Jinsong Tan:
A note on the inapproximability of correlation clustering. Inf. Process. Lett. 108(5): 331-335 (2008) - [c6]Jinsong Tan:
Inapproximability of Maximum Weighted Edge Biclique and Its Applications. TAMC 2008: 282-293 - [c5]Michael J. Kearns, Jinsong Tan:
Biased Voting and the Democratic Primary Problem. WINE 2008: 639-652 - 2007
- [j3]Jinsong Tan, Kok Seng Chua, Louxin Zhang, Song Zhu:
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis. Algorithmica 48(2): 203-219 (2007) - [j2]Jinsong Tan, Louxin Zhang:
The Consecutive Ones Submatrix Problem for Sparse Matrices. Algorithmica 48(3): 287-299 (2007) - [c4]Michael J. Kearns, Jinsong Tan, Jennifer Wortman:
Privacy-Preserving Belief Propagation and Sampling. NIPS 2007: 745-752 - [c3]Kuzman Ganchev, Alex Kulesza, Jinsong Tan, Ryan Gabbard, Qian Liu, Michael J. Kearns:
Empirical Price Modeling for Sponsored Search. WINE 2007: 541-548 - [i2]Jinsong Tan:
Inapproximability of Maximum Weighted Edge Biclique via Randomized Reduction and Its Applications. CoRR abs/0704.0468 (2007) - [i1]Jinsong Tan:
A Note on the Inapproximability of Correlation Clustering. CoRR abs/0704.2092 (2007) - 2005
- [c2]Jinsong Tan, Kok Seng Chua, Louxin Zhang:
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis. COCOON 2005: 74-83 - 2004
- [c1]Jinsong Tan, Louxin Zhang:
Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices. ISAAC 2004: 835-846 - 2003
- [j1]Jinsong Tan:
On Cheeger inequalities of a graph. Discret. Math. 269(1-3): 315-323 (2003)
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-12-10 20:44 CET 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: