![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Nalina Phisanbut
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c7]Lutfee Phalawan, Nalina Phisanbut, Punpiti Piamsa-nga:
A Weakly-Supervised Glass Bottle Defect Detection System Based on Multi-View Analysis. JCSSE 2023: 79-83 - 2022
- [c6]Watcharachat Plangsri, Nalina Phisanbut, Punpiti Piamsa-nga:
Unsupervised concept identification from a large corpus of research documents. KST 2022: 46-50 - 2020
- [c5]Chutima Wutthikhet, Nalina Phisanbut, Punpiti Piamsa-nga:
Business-intelligence framework for visualization and its associate text narration. KST 2020: 75-79
2010 – 2019
- 2013
- [c4]Markus Rosenkranz, Nalina Phisanbut:
A Symbolic Approach to Boundary Problems for Linear Partial Differential Equations - Applications to the Completely Reducible Case of the Cauchy Problem with Constant Coefficients. CASC 2013: 301-314 - [i1]Markus Rosenkranz, Nalina Phisanbut:
A Symbolic Approach to Boundary Problems for Linear Partial Differential Equations: Applications to the Completely Reducible Case of the Cauchy Problem with Constant Coefficients. CoRR abs/1304.7380 (2013) - 2011
- [b1]Nalina Phisanbut:
Practical simplification of elementary functions using CAD. University of Bath, Somerset, UK, 2011 - 2010
- [j2]Nalina Phisanbut, Russell J. Bradford, James H. Davenport:
Geometry of branch cuts. ACM Commun. Comput. Algebra 44(3/4): 132-135 (2010)
2000 – 2009
- 2007
- [j1]James C. Beaumont, Russell J. Bradford, James H. Davenport
, Nalina Phisanbut:
Testing elementary function identities using CAD. Appl. Algebra Eng. Commun. Comput. 18(6): 513-543 (2007) - 2005
- [c3]James C. Beaumont, Nalina Phisanbut, Russell J. Bradford:
Practical Simplification of Elementary Functions Using CAD. Algorithmic Algebra and Logic 2005: 35-39 - [c2]James C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut:
Adherence is better than adjacency: computing the Riemann index using CAD. ISSAC 2005: 37-44 - 2004
- [c1]James C. Beaumont, Russell J. Bradford, James H. Davenport
, Nalina Phisanbut:
A poly-algorithmic approach to simplifying elementary functions. ISSAC 2004: 27-34
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint