Author image not provided
 Michèle Soria

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article5.55
Citation Count111
Publication count20
Publication years1990-2016
Available for download4
Average downloads per article116.25
Downloads (cumulative)465
Downloads (12 Months)18
Downloads (6 Weeks)0
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


20 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 20
Result page: 1 2

Sort by:

1
August 2016 Algorithmica: Volume 75 Issue 4, August 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0


2
December 2012 Discrete Applied Mathematics: Volume 160 Issue 18, December, 2012
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 7

In the framework of analytic combinatorics, Boltzmann models give rise to efficient algorithms for the random generation of combinatorial objects. This paper proposes an efficient Boltzmann sampler for ordered structures defined by first-order differential specifications. Under an abstract real-arithmetic computation model, our algorithm is of linear complexity for free generation; ...
Keywords: Combinatorics, Boltzmann sampler, Differential specification, Random sampling

3
November 2012 Journal of Combinatorial Theory Series A: Volume 119 Issue 8, November, 2012
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 4

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the constructible classes of Flajolet and Sedgewick with Joyal�s species theory. We extend the implicit species theorem to structures ...
Keywords: Complexity, Generating functions, Newton iteration, Analytic combinatorics, Species theory

4 published by ACM
September 2011 ACM Transactions on Algorithms (TALG): Volume 7 Issue 4, September 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 13,   Downloads (Overall): 369

Full text available: PDFPDF

5
September 2011 Journal of Symbolic Computation: Volume 46 Issue 9, September, 2011
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0


6
September 2011 Combinatorics, Probability and Computing: Volume 20 Issue 5, September 2011
Publisher: Cambridge University Press
Bibliometrics:
Citation Count: 0

Philippe Flajolet, mathematician and computer scientist extraordinaire, the father of analytic combinatorics, suddenly passed away on 22 March 2011, at the prime of his career. He is celebrated for opening new lines of research in the analysis of algorithms, developing powerful new methods, and solving difficult open problems. His research ...

7
August 2011 Theoretical Computer Science: Volume 412 Issue 35, August, 2011
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0


8 published by ACM
July 2011 ACM Communications in Computer Algebra: Volume 45 Issue 1/2, March/June 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 4,   Downloads (Overall): 30

Full text available: PDFPDF

9
January 2011 SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Downloads (Overall): 57

Full text available: PDFPDF
The well-know needle experiment of Buffon can be regarded as an analog (i.e., continuous) device that stochastically "computes" the number 2/π = 0.63661, which is the experiment's probability of success. Generalizing the experiment and simplifying the computational framework, we consider probability distributions, which can be produced perfectly , from a ...

10
January 2010 ALENEX '10: Proceedings of the Meeting on Algorithm Engineering & Expermiments
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 1

Full text available: PDFPDF
Random increasing k -trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. We study in this paper a notion called connectivity-profile and derive asymptotic estimates for it; some interesting consequences will also be given.

11
November 2009 Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28---July 2, 2009, Revised Selected Papers
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

This paper examines the distances between vertices in a rooted k -tree, for a fixed k , by exhibiting a correspondence with a variety of trees that can be specified in terms of combinatorial specifications. Studying these trees via generating functions, we show a Rayleigh limiting distribution for expected distances ...

12
June 2009 ECMDA-FA '09: Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 19

The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalability, some approaches claim to provide mechanisms that are adapted to numerous and huge models. The problem is that those approaches cannot be validated as it is ...

13
October 2001 Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday: Volume 19 Issue 3-4, October-December 2001
Publisher: John Wiley & Sons, Inc.
Bibliometrics:
Citation Count: 25

Keywords: coalescing saddle points, random graph, singularity analysis, airy function, analytic combinatorics, random generation, stable law, multiconnectivity, planar map

14
July 2000 ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

A considerable number of asymptotic distributions arising in random combinatorics and analysis of algorithms are of the exponential-quadratic type ( e - x 2 ), that is, Gaussian. We exhibit here a new class of "universal" phenomena that are of the exponential-cubic type ( e ix 3 ), corresponding to ...

15
May 1997 SIAM Journal on Discrete Mathematics: Volume 10 Issue 2, May 1997
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 6

We present a general theorem that can be used to identify the limiting distribution for a class of combinatorial schemata. For example, many parameters in random mappings can be covered in this way. In particular, we can derive the limiting distribution of those points with a given number of total ...
Keywords: combinatorial constructions, random mappings, limiting distributions

16
June 1995 Theoretical Computer Science: Volume 144 Issue 1, June 1995
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

There is a wide field of combinatorial constructions, especially in the combinatorial analysis of algorithms, where it is possible to find an explicit generating function y(x) = �ynxn for the numbers yn of objects of size n and the bivariate generating function y(x, u) = �ynkxnuk for the numbers ynk ...

17
June 1995 Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth): Volume 144 Issue 1-2, June 26, 1995
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 4


18
April 1993 Discrete Mathematics - Special issue on combinatorics and algorithms: Volume 114 Issue 1-3, April 28, 1993
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 13


19
January 1991 SIAM Journal on Discrete Mathematics: Volume 4 Issue 1, Feb. 1991
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1


20
March 1990 Journal of Combinatorial Theory Series A: Volume 53 Issue 2, Mar. 1990
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 10




The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us