#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2005

2018

- This year (1)
- Last 5 years (10)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

#### Organism

Learn More

- Sebastian Freundt, Peter Horn, Alexander Konovalov, Steve Linton, Dan Roozemond
- AISC/MKM/Calculemus
- 2008

We present three examples of the composition of Computer Algebra Systems to illustrate the progress on a composability infrastructure as part of the SCIEnce (Symbolic Computation Infrastructure forâ€¦ (More)

- Vladimir Komendantsky, Alexander Konovalov, Steve Linton
- Electr. Notes Theor. Comput. Sci.
- 2012

We report on an extendable implementation of the communication interface connecting Coq proof assistant to the computational algebra system GAP using the Symbolic Computation Software Composabilityâ€¦ (More)

The suitability of the BPEL workflow description language for the dynamic composition of Web services representing computational algebra systems is investigated. The prototype implementation of theâ€¦ (More)

Exposing computer algebra systems as computing services allow their further development and integration in complex service-oriented architectures. While existing standards may be used for serviceâ€¦ (More)

- Nikolay A. Davydov, Asiya Mustafina, +5 authors Igor S. Antipin
- Chemphyschem : a European journal of chemicalâ€¦
- 2012

The complex formation of d-metal ions at the interface of Tb(III)-doped silica nanoparticles modified by amino groups is introduced as a route to sensing d-metal ions and some organic molecules.â€¦ (More)

- Yasset PÃ©rez-Riverol, Laurent Gatto, +12 authors Juan Antonio VizcaÃno
- PLoS Computational Biology
- 2016

A â€™Ten Simple Rulesâ€™ guide to git and GitHub. We describe and provide examples on how to use these software to track projects, as users, teams and organizations. We document collaborative developmentâ€¦ (More)

- V. A. Bovdi, Eric Jespers, Alexander Konovalov
- Math. Comput.
- 2011

Using the Luthar-Passi method, we investigate the classical Zassenhaus conjecture for the normalized unit group of integral group rings of Janko simple groups. As a consequence, for the Janko groupsâ€¦ (More)

- Steve Linton, Kevin Hammond, +5 authors Dan Roozemond
- J. Symb. Comput.
- 2013

We present the results of the first four years of the European research project SCIEnce â€“ Symbolic Computation Infrastructure in Europe (http://www.symbolic-computation.org), which aims to provideâ€¦ (More)

For a prime p let G be a finite p-group and K a field of characteristic p. The Modular Isomorphism Problem (MIP) asks whether the modular group algebra KG determines the isomorphism type of G. Weâ€¦ (More)

- Reimer Behrends, Kevin Hammond, +5 authors Philip W. Trinder
- Concurrency and Computation: Practice andâ€¦
- 2016

model of hierarchical distances. The coordination DSL HdpH exposes node-to-node latencies abstractly to the programmer as distances in a metric space. More precisely, the distance between nodes is aâ€¦ (More)