Sciweavers

1730 search results - page 135 / 346
» Algebra and Computation
Sort
View
97
Voted
MOC
2002
103views more  MOC 2002»
15 years 13 days ago
A computational approach to Hilbert modular group fixed points
Some useful information is known about the fundamental domain for certain Hilbert modular groups. The six nonequivalent points with nontrivial isotropy in the fundamental domains u...
Jesse Ira Deutsch
89
Voted
ICALP
2004
Springer
15 years 6 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
130
Voted
NCA
2008
IEEE
15 years 7 months ago
On the Application of Formal Methods for Specifying and Verifying Distributed Protocols
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the tw...
Marina Gelastou, Chryssis Georgiou, Anna Philippou
100
Voted
AISC
2008
Springer
15 years 2 months ago
Symbolic Computation Software Composability
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 I...
Sebastian Freundt, Peter Horn, Alexander Konovalov...
SPAA
2010
ACM
14 years 11 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman