Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Franco Mileto

dblp:40/4316 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1966
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Electronic design automation · 90% Embedded and real-time systems · 10%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis		 0.031965
Average Values of Quantities Appearing in Multiple Output Boolean Minimization · IEEE Trans. Electron. Comput. 1965
Statistical Complexity of Algorithms for Boolean Function Minimization · J. ACM 1965
Average Values of Quantities Appearing in Boolean Function Minimization · IEEE Trans. Electron. Comput. 1964
Electronic design automation › logic synthesis › logic minimization
boolean function minimization		 0.021965
Statistical Complexity of Algorithms for Boolean Function Minimization · J. ACM 1965
Average Values of Quantities Appearing in Boolean Function Minimization · IEEE Trans. Electron. Comput. 1964
Electronic design automation › logic synthesis
two-level logic minimization		 0.021965
Average Values of Quantities Appearing in Multiple Output Boolean Minimization · IEEE Trans. Electron. Comput. 1965
Average Values of Quantities Appearing in Boolean Function Minimization · IEEE Trans. Electron. Comput. 1964
Embedded and real-time systems › real-time scheduling
complexity analysis		 0.011965
Statistical Complexity of Algorithms for Boolean Function Minimization · J. ACM 1965
Electronic design automation › logic synthesis › logic minimization
multiple output minimization		 0.011965
Average Values of Quantities Appearing in Multiple Output Boolean Minimization · IEEE Trans. Electron. Comput. 1965
Electronic design automation › logic synthesis
prime implicant generation		 0.011965
Statistical Complexity of Algorithms for Boolean Function Minimization · J. ACM 1965

Methods — techniques the papers use, named apart from their topics

quine's method · 0.0mccluskey's method · 0.0combinatorial analysis · 0.0
YearPublicationVenuePosition
1966 Corrigenda: "Statistical Complexity of Algorithms for Boolean Function Minimization"
abstract
No abstract available.
Franco Mileto, Gianfranco R. Putzolu
 J. ACM1
1965 Statistical Complexity of Algorithms for Boolean Function Minimization
abstract
The first problem in a two level Boolean minimization is the determination of the prime k -cubes. This paper is concerned with the estimation of the statistical complexity of some well-known algorithms which solve this problem. Formulas are given for the average number of comparison operations among k -cubes occurring in Quine's method and in Mc-Cluskey's method; these quantities provide indications of the average execution time of computer programs based on the corresponding algorithms. Numerical values are given and commented on. Formulas are also obtained for the variance of the number of k -cubes and the variance of the number of cubes of a Boolean function; in fact the calculation of these quantities is strictly related to that of the average number of comparison operations among k -cubes. These variances give an idea of the probable error made by using the corresponding average values (obtained in a previous paper by the authors) to make forecasts. It turns out that this error is quite small.
Franco Mileto, Gianfranco R. Putzolu
 J. ACM1
1965 Average Values of Quantities Appearing in Multiple Output Boolean Minimization
abstract
In connection with the problem of two-level minimization of systems of Boolean functions, formulas are obtained for the following statistical quantities: average number of k cubes, prime k cubes, and essential k cubes of a system of Boolean functions. The parameters appearing in the formulas are the number of variables, the number of functions of the system, and the number of ``one'' vertices of each function. Numerical evaluations are given. Increasing by one the number of variables n of a system of m functions roughly results in multiplying the average numbers of cubes and prime cubes by a factor of about 2.2 to 2.3. The ratio of the average numbers of essential cubes and prime cubes rapidly decreases increasing n or m, so that the minimization algorithms, which obtain the essential cubes before the prime cubes, seem statistically unsuitable to solve ``large'' minimization problems. The average occupation memory occurring in Quine, McCluskey, and Bartee algorithms is also evaluated. Its rate of increase with the number of variables is about 2.5.
Franco Mileto, Gianfranco R. Putzolu
 IEEE Trans. Electron. Comput.1
1964 Average Values of Quantities Appearing in Boolean Function Minimization
abstract
In connection with the problem of two-level minimization of Boolean functions, we have obtained in a combinatorial way the formulas which give the following quantities of statistical interest: average numbers of k cubes, prime k cubes and essential k cubes of a Boolean function. The parameters which appear in our formulas are: number of variables, number of ``one'' vertices and number of ``don't care'' vertices.
Franco Mileto, Gianfranco R. Putzolu
 IEEE Trans. Electron. Comput.1