The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 4942 of Mathematical Reviews Vol. , Issue 99g
[page]

1999
*
Mathematical Reviews
*

(English summary) Randomization

*methods*in*algorithm**design*(Princeton, NJ, 1997), 45-59, DIMACS Ser. Discrete Math.*Theoret*. Comput. Sci., 43, Amer. Math. Soc., Providence, RI, 1999. ... (English summary) Randomization*methods*in*algorithm**design*(Princeton, NJ, 1997), 239-249, DIMACS Ser. Discrete Math.*Theoret*. Comput. Sci., 43, Amer. Math. Soc., Providence, RI, 1999. ...##
###
Page 5132 of Mathematical Reviews Vol. , Issue 97H
[page]

1997
*
Mathematical Reviews
*

*The*author describes a three-level

*design*

*of*an

*algorithm*: (1)

*design*

*of*a network- independent programming environment; (2)

*design*

*of*virtual net- works

*for*

*the*

*algorithms*; (3) emulation

*of*these virtual ... We propose a new

*algorithm*which (unlike

*the*earlier

*method*) constructs a large family

*of*k-fault-tolerant solutions,

*for*any given circulant

*graph*(and any value

*of*k). ...

##
###
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
[chapter]

2005
*
Lecture Notes in Computer Science
*

Specifically, we have demonstrated

doi:10.1007/11427186_3
fatcat:3bwy4zp3f5dgdonrjt2mi5opom
*for**the*first time that significant*parallel*speedups are attainable*for*arbitrary instances*of*a variety*of**graph*problems and are developing a library*of*fundamental ... Our results*for*several fundamental*graph*theory problems are*the*first ever to achieve*parallel*speedups. ... Experimental*Parallel**Algorithms*We discuss our*design*and implementation*of**theoretically*-efficient*parallel**algorithms**for*combinatorial (irregular) problems that deliver significant speedups on typical ...##
###
Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems

2012
*
2012 Third International Conference on Networking and Computing
*

*The*paper shows summary

*of*

*the*author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted because

*of*space limitation. ... Satoshi Taoka

*of*Hiroshima University

*for*arranging

*the*program and

*for*assisting him in preparing

*the*presentation. ... Acknowledgments

*The*author would like to express his sencere thanks to Professor Koji Nakano and Professor Satoshi Fujita

*of*Hiroshima University

*for*organizing

*the*workshop. ...

##
###
DCCB and SCC based fast circuit partition algorithm for parallel SPICE simulation

2009
*
2009 IEEE 8th International Conference on ASIC
*

This paper presents an efficient circuit partition

doi:10.1109/asicon.2009.5351211
fatcat:lfyr2xtzvzek5frsjzv3siufcq
*algorithm*specially*designed**for*VLSI circuit partition and*parallel*simulation.*The**algorithm*is established on recognizing DCCB and SCC. ... Our*algorithm*shows preferable solution quality and speedup*for*real experimental circuit*designs*compared with traditional ones.1 ... This pretreatment*method*is*for**the*first time introduced in VLSI circuit partition*algorithms**for*adapting*parallel*simulation task. ...##
###
Engineering Graph Partitioning Algorithms
[chapter]

2012
*
Lecture Notes in Computer Science
*

Simulation space is discretized into a mesh Solution

doi:10.1007/978-3-642-30850-5_3
fatcat:zkee6zsjcjbv7iaxrmjdkocrx4
*of*partial differential equations are approximated by linear equations Number*of*vertices can become quite large → time and memory*Parallel*processing ... required total node weight*of*each block ≤ 1 + k total node weight total weight*of*cut edges as small as possible Applications: various numerical simulations, VLSI*design*, route planning, . . . ... Estimate likelihood from a random walk with*the*same mean and variance as observed from*the*current walk.Graph Partitioning Department*of*Informatics Institute*for**Theoretical*Informatics Department*of*...##
###
Book reports

1988
*
Computers and Mathematics with Applications
*

*Parallel*

*methods*

*for*partial differential equations 9.

*Parallel*

*algorithms*

*of*matrix computations 10. Programming with

*the*BLAS 11. ...

*The*imbedding distribution

*of*a

*graph*3.5.

*Algorithms*and formulas

*for*minimum imbeddings 4. Imbedded voltage

*graphs*and current

*graphs*4.1.

*The*derived imbeddings 4.2. ... Applications

*of*multiple scaling in mechanics. Edited by P. G. Ciarlet and E. Sanchez-Palencia. Masson, Paris (1987). 350 pages. ...

##
###
High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

2018
*
Dagstuhl Reports
*

*The*abstracts included in this report contain and survey recent state-

*of*-

*the*-art results, but also point to promising new directions

*for*high-performance

*graph*

*algorithms*and their applications, both from ...

*The*seminar reflected

*the*ongoing qualitative change how

*graph*

*algorithms*are used in practice due to (i)

*the*complex structure

*of*

*graphs*in new and emerging applications, (ii)

*the*size

*of*typical inputs ... We give implementations

*of*

*theoretically*-efficient

*parallel*

*algorithms*

*for*13 important

*graph*problems. ...

##
###
Page 1258 of Mathematical Reviews Vol. , Issue 86c
[page]

1986
*
Mathematical Reviews
*

They also show

*the*relative powers*of*vari- ous (*theoretical*) models*of**the**parallel*computer, and illustrate techniques*of**designing**parallel**algorithms*. ... Tsin, Yung H. (3-AB-C); Chin, Francis Y. (3-AB-C) Efficient*parallel**algorithms**for*a class*of**graph**theoretic*problems. SIAM J. Comput. 13 (1984), no. 3, 580-599. ...##
###
Structural parallel algorithmics
[chapter]

1991
*
Lecture Notes in Computer Science
*

*The*notion

*of*fully-

*parallel*

*algorithm*represents an ultimate

*theoretical*goal

*for*

*designers*

*of*

*parallel*

*algorithms*. ... Assignment

*of*processors to jobs is a typical concern in

*parallel*

*algorithms*;

*for*instance, one

*of*

*the*most powerful methodologies

*for*

*designing*

*parallel*

*algorithms*is to have a first

*design*in terms

*of*...

##
###
Modeling the Parallelization of the Edmonds-Karp Algorithm and Application

2019
*
Computer and Information Science
*

|E|2 (where |V|

doi:10.5539/cis.v12n3p81
fatcat:t6xupmfzznakba5pfafmvf6kwq
*designates**the*number*of*vertices and |E|*designates**the*number*of**the*edges*of**the**graph*). ... So why we are studying its implementation on inexpensive*parallel*platforms such as OpenMp and GP-GPU. Our work also highlights*the*limits*for**parallel*computing on this*algorithm*. ... OpenMP GP-GPU Average degree*of**graphs*Acceleration http://cis.ccsenet.org Computer and Information Science Vol. 12, No. 3; 2019 ...##
###
Page 659 of Mathematical Reviews Vol. 52, Issue 2
[page]

1976
*
Mathematical Reviews
*

Systems

*for*management, and administration: (*Theoretical*aspects*of*information systems*for*management;*Design*and implementation*of*management information systems; Economics*of*information processing; ... Hecht, Topological sorting and flow*graphs*(pp. 494-499); W. F. Smyth and W. M. L. Benzi, An*algorithm**for*finding*the*diameter*of*a*graph*(pp. 500- COMPUTER SCIENCE 52 #4687 503); John Bruno, E. G. ...##
###
Platform Dependent Verification: On Engineering Verification Tools for 21st Century

2011
*
Electronic Proceedings in Theoretical Computer Science
*

*The*paper overviews recent developments in platform-dependent explicit-state LTL model checking. ...

*The*general idea

*of*employing

*the*distributed-memory platform

*for*execution

*of*a

*parallel*

*graph*

*algorithm*was, and still is, as follows. ... Fighting

*the*Space Explosion With

*the*increase in complexity and degree

*of*

*parallelism*

*of*computer systems, it became even more important to develop formal

*methods*

*for*ensuring their quality. ...

##
###
Page 5438 of Mathematical Reviews Vol. , Issue 88j
[page]

1988
*
Mathematical Reviews
*

A representation

*of*both*parallel**algorithms*and*parallel*computer systems in*the*form*of*oriented*graphs*is formulated. ... Métivier, An*algorithm**for*computing asynchronous automata in*the*case*of*acyclic noncommutation*graphs*(pp. 226-236); J.-E. ...##
###
Design, analysis and performance evaluation of parallel algorithms for solving triangular linear systems on multicore platforms

2021
*
Reserche operationelle
*

In this paper, we focus on schedulings

doi:10.1051/ro/2021009
fatcat:q4nue5tsb5fybaqbi6g5khvcsi
*of*2-steps*graph*with constant task cost obtained when*parallelizing**algorithm*solving triangular linear system. ... We compare also these results to those*of**the*appropriate procedure in to so-called PLASMA library (*Parallel*Linear Algebra*for*Scalable Multi-core Architectures) ... Nahid EMAD*for*her reception in PRISM laboratory, University*of*Versailles and provision an account*of*GRID'5000 to make experimentations. ...
« Previous

*Showing results 1 — 15 out of 124,696 results*