Sciweavers

1763 search results - page 107 / 353
» A Formalization of Polytime Functions
Sort
View
SAS
1993
Springer
139views Formal Methods» more  SAS 1993»
15 years 2 months ago
Compiling FX on the CM-2
Type and effect systems provide a safe and effective means of programming high-performance parallel computers with a high-level language that integrates both functional and impe...
Jean-Pierre Talpin, Pierre Jouvelot
FMICS
2009
Springer
15 years 1 months ago
A Certified Implementation on Top of the Java Virtual Machine
Abstract. Safe is a first-order functional language with unusual memory management features: memory can be both explicitly and implicitly deallocated at some specific points in the...
Javier de Dios, Ricardo Peña-Marí
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
14 years 9 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 8 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
MJ
2008
121views more  MJ 2008»
14 years 8 months ago
Transport properties of graphene nanoribbon heterostructures
We study the electronic and transport properties of heterostructures formed by armchair graphene nanoribbons with intersections of finite length. We describe the system by a tight...
L. Rosales, P. Orellana, Z. Barticevic, M. Pacheco