default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. A. M. Vermaseren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j7]Ben Ruijl
, Takahiro Ueda, J. A. M. Vermaseren:
Forcer, a Form program for the parametric reduction of four-loop massless propagator diagrams. Comput. Phys. Commun. 253: 107198 (2020)
2010 – 2019
- 2018
- [c8]S. Ali Mirsoleimani, H. Jaap van den Herik, Aske Plaat, Jos Vermaseren:
A Lock-free Algorithm for Parallel MCTS. ICAART (2) 2018: 589-598 - [c7]S. Ali Mirsoleimani, H. Jaap van den Herik, Aske Plaat, Jos Vermaseren:
Pipeline Pattern for Parallel MCTS. ICAART (2) 2018: 614-621 - 2017
- [c6]S. Ali Mirsoleimani, Aske Plaat, H. Jaap van den Herik, Jos Vermaseren:
An Analysis of Virtual Loss in Parallel MCTS. ICAART (2) 2017: 648-652 - [i21]S. Ali Mirsoleimani, Aske Plaat, H. Jaap van den Herik, Jos Vermaseren:
Structured Parallel Programming for Monte Carlo Tree Search. CoRR abs/1704.00325 (2017) - [i20]Ben Ruijl, Takahiro Ueda, Jos Vermaseren:
FORM version 4.2. CoRR abs/1707.06453 (2017) - 2016
- [c5]Sayyed Ali Mirsoleimani, Aske Plaat, H. Jaap van den Herik, Jos Vermaseren:
Ensemble UCT Needs High Exploitation. ICAART (2) 2016: 370-376 - [i19]S. Ali Mirsoleimani, Aske Plaat, H. Jaap van den Herik, Jos Vermaseren:
A New Method for Parallel Monte Carlo Tree Search. CoRR abs/1605.04447 (2016) - [i18]John C. Collins, J. A. M. Vermaseren:
Axodraw Version 2. CoRR abs/1606.01177 (2016) - 2015
- [j6]Jan Kuipers, Takahiro Ueda, J. A. M. Vermaseren:
Code optimization in FORM. Comput. Phys. Commun. 189: 1-19 (2015) - [c4]S. Ali Mirsoleimani, Aske Plaat, H. Jaap van den Herik, Jos Vermaseren:
Scaling Monte Carlo Tree Search on Intel Xeon Phi. ICPADS 2015: 666-673 - [c3]Sayyed Ali Mirsoleimani, Aske Plaat, H. Jaap van den Herik, Jos Vermaseren:
Parallel Monte Carlo Tree Search from Multi-core to Many-core Processors. TrustCom/BigDataSE/ISPA (3) 2015: 77-83 - [i17]S. Ali Mirsoleimani, Aske Plaat, H. Jaap van den Herik, Jos Vermaseren:
Scaling Monte Carlo Tree Search on Intel Xeon Phi. CoRR abs/1507.04383 (2015) - 2014
- [c2]Ben Ruijl, Jos Vermaseren, Aske Plaat, H. Jaap van den Herik:
Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification. ICAART (1) 2014: 724-731 - [i16]Ben Ruijl, Jos Vermaseren, Aske Plaat, H. Jaap van den Herik:
HEPGAME and the Simplification of Expressions. CoRR abs/1405.6369 (2014) - [i15]S. Ali Mirsoleimani, Aske Plaat, Jos Vermaseren, H. Jaap van den Herik:
Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi. CoRR abs/1409.4297 (2014) - [i14]Ben Ruijl, Aske Plaat, Jos Vermaseren, H. Jaap van den Herik:
Why Local Search Excels in Expression Simplification. CoRR abs/1409.5223 (2014) - 2013
- [j5]Jan Kuipers, Takahiro Ueda, J. A. M. Vermaseren, J. Vollinga:
FORM version 4.0. Comput. Phys. Commun. 184(5): 1453-1467 (2013) - [j4]Jan Kuipers, Aske Plaat, J. A. M. Vermaseren, H. Jaap van den Herik:
Improving multivariate Horner schemes with Monte Carlo tree search. Comput. Phys. Commun. 184(11): 2391-2395 (2013) - [c1]H. Jaap van den Herik, Jan Kuipers, J. A. M. Vermaseren, Aske Plaat:
Investigations with Monte Carlo Tree Search for Finding Better Multivariate Horner Schemes. ICAART (Revised Selected Papers) 2013: 3-20 - [i13]Jan Kuipers, Takahiro Ueda, J. A. M. Vermaseren:
Code Optimization in FORM. CoRR abs/1310.7007 (2013) - [i12]Ben Ruijl, Jos Vermaseren, Aske Plaat, H. Jaap van den Herik:
Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification. CoRR abs/1312.0841 (2013) - 2012
- [i11]Jan Kuipers, Takahiro Ueda, J. A. M. Vermaseren, J. Vollinga:
FORM version 4.0. CoRR abs/1203.6543 (2012) - [i10]Jan Kuipers, J. A. M. Vermaseren, Aske Plaat, H. Jaap van den Herik:
Improving multivariate Horner schemes with Monte Carlo tree search. CoRR abs/1207.7079 (2012) - 2011
- [i9]J. A. M. Vermaseren:
FORM development. CoRR abs/1101.0511 (2011) - [i8]Jan Kuipers, J. A. M. Vermaseren:
About a conjectured basis for Multiple Zeta Values. CoRR abs/1105.1884 (2011) - 2010
- [j3]Johannes Blümlein, D. J. Broadhurst, J. A. M. Vermaseren:
The Multiple Zeta Value data mine. Comput. Phys. Commun. 181(3): 582-625 (2010) - [j2]M. Tentyukov, J. A. M. Vermaseren:
The multithreaded version of FORM. Comput. Phys. Commun. 181(8): 1419-1427 (2010) - [i7]M. Tentyukov, J. A. M. Vermaseren, J. Vollinga:
Parallel versions of the symbolic manipulation system FORM. CoRR abs/1006.2099 (2010) - [i6]J. A. M. Vermaseren:
FORM facts. CoRR abs/1006.4512 (2010)
2000 – 2009
- 2009
- [i5]Johannes Blümlein, D. J. Broadhurst, J. A. M. Vermaseren:
The Multiple Zeta Value Data Mine. CoRR abs/0907.2557 (2009) - 2007
- [j1]M. Tentyukov, J. A. M. Vermaseren:
Extension of the functionality of the symbolic program FORM by external software. Comput. Phys. Commun. 176(6): 385-405 (2007) - [i4]M. Tentyukov, J. A. M. Vermaseren:
The Multithreaded version of FORM. CoRR abs/hep-ph/0702279 (2007) - 2006
- [i3]M. Tentyukov, J. A. M. Vermaseren:
Extension of the functionality of the symbolic program FORM by external software. CoRR abs/cs/0604052 (2006) - 2005
- [i2]M. Tentyukov, J. A. M. Vermaseren, H. M. Staudenmaier:
ParFORM: recent development. CoRR abs/cs/0510093 (2005) - 2004
- [i1]M. Tentyukov, D. Fliegner, M. Frank, A. Onischenko, A. Retey, H. M. Staudenmaier, J. A. M. Vermaseren:
ParFORM: Parallel Version of the Symbolic Manipulation Program FORM. CoRR cs.SC/0407066 (2004)
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-04-25 05:52 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:
