default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatsusuke Nabeshima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Katsusuke Nabeshima:
Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system. Appl. Algebra Eng. Commun. Comput. 35(1): 55-70 (2024)- [j15]Shinichi Tajima, Katsusuke Nabeshima:
A Deterministic Method for Computing Bertini Type Invariants of Parametric Ideals. Math. Comput. Sci. 18(3): 14 (2024) - [c21]Ryosuke Kuramochi, Kazuki Tanaka, Katsusuke Nabeshima:
On the Radical of a Polynomial Ideal with Parameters. CASC 2024: 193-214 - [c20]Natsu Wada, Katsusuke Nabeshima:
Merging Multiple Algorithms for Computing Comprehensive Gröbner Systems Using Parallel Processing. CASC 2024: 373-391 - [e2]Katsusuke Nabeshima, Stephen M. Watt:
Proceedings of the SCSS 2024 Work in Progress Workshop co-located with 10th International Symposium on Symbolic Computation in Software Science (SCSS 2024), Tokyo, Japan, Aug 28-30, 2024. CEUR Workshop Proceedings 3754, CEUR-WS.org 2024 [contents] - 2023
- [j14]Shinichi Tajima, Katsusuke Nabeshima
, Katsuyoshi Ohara, Yoko Umeta:
Computing Holonomic D-Modules Associated to a Family of Non-isolated Hypersurface Singularities via Comprehensive Gröbner Systems of PBW Algebra. Math. Comput. Sci. 17(1): 6 (2023) - [c19]Katsusuke Nabeshima, Shinichi Tajima:
Effective Algorithm for Computing Noetherian Operators of Positive Dimensional Ideals. CASC 2023: 272-291 - 2022
- [j13]Katsusuke Nabeshima, Shinichi Tajima:
Effective algorithm for computing Noetherian operators of zero-dimensional ideals. Appl. Algebra Eng. Commun. Comput. 33(6): 867-899 (2022) - [j12]Katsusuke Nabeshima, Shinichi Tajima:
Correction: Effective algorithm for computing Noetherian operators of zero‑dimensional ideals. Appl. Algebra Eng. Commun. Comput. 33(6): 901 (2022) - 2021
- [j11]Katsusuke Nabeshima, Shinichi Tajima:
A new algorithm for computing logarithmic vector fields along an isolated singularity and Bruce-Roberts Milnor ideals. J. Symb. Comput. 107: 190-208 (2021) - [j10]Katsusuke Nabeshima, Shinichi Tajima:
Testing Zero-Dimensionality of Varieties at a Point. Math. Comput. Sci. 15(2): 317-331 (2021) - [j9]Shinichi Tajima, Katsusuke Nabeshima:
An Algorithm for Computing Torsion Differential Forms Associated with an Isolated Hypersurface Singularity. Math. Comput. Sci. 15(2): 353-367 (2021) - [c18]Shinichi Tajima, Katsusuke Nabeshima:
A New Deterministic Method for Computing Milnor Number of an ICIS. CASC 2021: 391-408 - [c17]Shinichi Tajima, Katsusuke Nabeshima:
Computing Grothendieck Point Residues via Solving Holonomic Systems of First Order Partial Differential Equations. ISSAC 2021: 361-368 - [i5]Katsusuke Nabeshima, Shinichi Tajima:
Methods for computing b-functions associated with μ-constant deformations - Case of inner modality 2 -. CoRR abs/2101.01384 (2021) - 2020
- [c16]Katsusuke Nabeshima:
Computing Parametric Standard Bases for Semi-weighted Homogeneous Isolated Hypersurface Singularities. CASC 2020: 447-460 - [c15]Shinichi Tajima, Takafumi Shibuta, Katsusuke Nabeshima:
Computing Logarithmic Vector Fields Along an ICIS Germ via Matlis Duality. CASC 2020: 543-562 - [c14]Hiroshi Teramoto, Katsusuke Nabeshima:
Parametric standard system for mixed module and its application to singularity theory. ISSAC 2020: 426-433 - [i4]Shinichi Tajima, Katsusuke Nabeshima:
Computing regular meromorphic differential forms via Saito's logarithmic residues. CoRR abs/2007.09950 (2020) - [i3]Shinichi Tajima, Katsusuke Nabeshima:
An effective method for computing Grothendieck point residue mappings. CoRR abs/2011.09092 (2020)
2010 – 2019
- 2019
- [j8]Katsusuke Nabeshima, Shinichi Tajima:
Solving Parametric Ideal Membership Problems and Computing Integral Numbers in a Ring of Convergent Power Series Via Comprehensive Gröbner Systems. Math. Comput. Sci. 13(1-2): 185-194 (2019) - [j7]Shinichi Tajima, Katsusuke Nabeshima:
An Implementation of the Lê-Teissier Method for Computing Local Euler Obstructions. Math. Comput. Sci. 13(1-2): 273-280 (2019) - [c13]Yosuke Sato, Hiroshi Sekigawa, Ryoya Fukasaku, Katsusuke Nabeshima:
On Parametric Border Bases. MACIS 2019: 10-15 - [c12]Katsusuke Nabeshima, Shinichi Tajima:
Generalized Integral Dependence Relations. MACIS 2019: 48-63 - [i2]Katsusuke Nabeshima, Shinichi Tajima:
Testing zero-dimensionality of varieties at a point. CoRR abs/1903.12365 (2019) - 2018
- [j6]Katsusuke Nabeshima, Katsuyoshi Ohara, Shinichi Tajima:
Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic D-modules. J. Symb. Comput. 89: 146-170 (2018) - 2017
- [j5]Katsusuke Nabeshima, Shinichi Tajima:
Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals. J. Symb. Comput. 82: 91-122 (2017) - 2016
- [j4]Katsusuke Nabeshima, Shinichi Tajima:
Computing Tjurina stratifications of μ-constant deformations via parametric local cohomology systems. Appl. Algebra Eng. Commun. Comput. 27(6): 451-467 (2016) - [c11]Katsusuke Nabeshima, Katsuyoshi Ohara, Shinichi Tajima:
Comprehensive Gröbner Systems in Rings of Differential Operators, Holonomic D-modules and B-functions. ISSAC 2016: 349-356 - 2015
- [c10]Katsusuke Nabeshima, Shinichi Tajima:
Efficient Computation of Algebraic Local Cohomology Classes and Change of Ordering for Zero-Dimensional Standard Bases. CASC 2015: 334-348 - [c9]Katsusuke Nabeshima, Shinichi Tajima:
Computing Logarithmic Vector Fields Associated with Parametric Semi-Quasihomogeneous Hypersurface Isolated Singularities. ISSAC 2015: 291-298 - [c8]Katsusuke Nabeshima, Shinichi Tajima:
Solving Extended Ideal Membership Problems in Rings of Convergent Power Series via Gröbner Bases. MACIS 2015: 252-267 - [i1]Katsusuke Nabeshima, Shinichi Tajima:
Algebraic Local Cohomology with Parameters and Parametric Standard Bases for Zero-Dimensional Ideals. CoRR abs/1508.06724 (2015) - 2014
- [c7]Katsusuke Nabeshima, Shinichi Tajima:
An Algorithm for Computing Standard Bases by Change of Ordering via Algebraic Local Cohomology. ICMS 2014: 414-418 - [c6]Katsusuke Nabeshima, Shinichi Tajima:
An Algorithm for Computing Tjurina Stratifications of μ-Constant Deformations by Using Local Cohomology Classes with Parameters. ICMS 2014: 523-530 - [c5]Katsusuke Nabeshima, Shinichi Tajima:
On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases. ISSAC 2014: 351-358 - [e1]Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, Ágnes Szántó:
International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014. ACM 2014, ISBN 978-1-4503-2501-1 [contents] - 2012
- [c4]Katsusuke Nabeshima:
Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems. CASC 2012: 248-259 - 2011
- [j3]Yosuke Sato, Shutaro Inoue, Akira Suzuki, Katsusuke Nabeshima, Kô Sakai:
Boolean Gröbner bases. J. Symb. Comput. 46(5): 622-632 (2011)
2000 – 2009
- 2009
- [j2]Katsusuke Nabeshima:
Reduced Gröbner Bases in Polynomial Rings over a Polynomial Ring. Math. Comput. Sci. 2(4): 587-599 (2009) - 2007
- [j1]Katsusuke Nabeshima:
PGB: a package for computing parametric Gröbner and related objects. ACM Commun. Comput. Algebra 41(3): 104-105 (2007) - [c3]Katsusuke Nabeshima:
A speed-up of the algorithm for computing comprehensive Gröbner systems. ISSAC 2007: 299-306 - 2005
- [c2]Katsusuke Nabeshima:
A Computation Method for ACGB-V. Algorithmic Algebra and Logic 2005: 173-180 - [c1]Katsusuke Nabeshima:
A Direct Products of Fields Approach to Comprehensive Gröbner Bases over Finite Fields. SYNASC 2005: 39-47
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-10-17 21:31 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:
