%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.14", %%% date = "07 July 2005", %%% time = "07:46:00 MDT", %%% filename = "parallelprocesslett.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "http://www.math.utah.edu/~beebe", %%% checksum = "26348 14493 57515 564660", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "BibTeX, bibliography, Parallel Processing %%% Letters", %%% supported = "yes", %%% docstring = "This is an almost complete bibliography of %%% Parallel Processing Letters (CODEN PPLTEE, %%% ISSN 0129-6264), published by World %%% Scientific. Publication began with volume %%% 1 in September 1991. %%% %%% The journal has World-Wide Web sites at %%% %%% http://www.ens-lyon.fr/PPL/ %%% http://www.wspc.co.uk/wspc/Journals/ppl/ppl.html %%% http://www.wspc.com/journals/journals.html %%% http://www.wspc.com/journals/ppl/ppl.html %%% http://www.worldscinet.com/ppl/ppl.shtml %%% %%% with a LaTeX style file, but only a few %%% tables of contents. %%% %%% At version 1.14, the year coverage looked %%% like this: %%% %%% 1991 ( 19) 1996 ( 53) 2001 ( 39) %%% 1992 ( 43) 1997 ( 41) 2002 ( 31) %%% 1993 ( 51) 1998 ( 58) 2003 ( 57) %%% 1994 ( 44) 1999 ( 53) 2004 ( 36) %%% 1995 ( 60) 2000 ( 35) %%% %%% Article: 620 %%% %%% Total entries: 620 %%% %%% Data for the bibliography has been collected %%% from the journal Web site, from the Compendex %%% database (1990--1996), from the %%% bibliographies in the TeX User Group %%% collection, from bibliographies in the %%% author's personal files, from the IEEE INSPEC %%% databases (1991--1997), and from the computer %%% science bibliography collection on %%% ftp.ira.uka.de in /pub/bibliography to which %%% many people of have contributed. The %%% snapshot of this collection was taken on %%% 5-May-1994, and it consists of 441 BibTeX %%% files, 2,672,675 lines, 205,289 entries, and %%% 6,375 String{} abbreviations, occupying %%% 94.8MB of disk space. The OCLC Contents1st %%% database does NOT cover this journal, nor %%% does the Science Citation Index database. %%% %%% Numerous errors in the sources noted above %%% have been corrected. Spelling has been %%% verified with the UNIX spell and GNU ispell %%% programs using the exception dictionary %%% stored in the companion file with extension %%% .sok. %%% %%% BibTeX citation tags are uniformly chosen %%% as name:year:abbrev, where name is the %%% family name of the first author or editor, %%% year is a 4-digit number, and abbrev is a %%% 3-letter condensation of important title %%% words. Citation tags were automatically %%% generated by software developed for the %%% BibNet Project. %%% %%% In this bibliography, entries are sorted in %%% publication order, using ``bibsort -byvolume''. %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|http://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"} %%% ==================================================================== %%% Bibliography entries: @Article{Albacea:1991:DMP, author = "E. A. Albacea", title = "Determining the mode in parallel", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "3--10", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia", countrypub = "Singapore", keywords = "linear time; optimal; parallel algorithm; parallel algorithms; set; sorting; sorting multisets; upper bound", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Arora:1991:MDC, author = "A. Arora and S. Dolev and M. Gouda", title = "Maintaining digital clocks in step", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "11--18", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B1265Z (Other digital circuits); C5150 (Other circuits for digital computers)", corpsource = "Dept. of Comput. Sci., Texas Univ., TX, USA", countrypub = "Singapore", keywords = "clocks; N-clock; simultaneously triggered clocks; stabilisation; stability; system", treatment = "P Practical", } @Article{Risset:1991:SPA, author = "T. Risset and Y. Robert", title = "Synthesis of processor arrays for the algebraic path problem: unifying old results and deriving new architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "19--28", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Lab. de l'Inf. du Parallelisme, LIP-IMAG, Lyon, France", countrypub = "Singapore", keywords = "acyclic graphs; algebraic path problem; computational complexity; constraints; direct; directed graphs; integration; limited broadcast facilities; processor arrays synthesis; systolic architectures; systolic arrays", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Olariu:1991:PTP, author = "S. Olariu and J. L. Schwing and Jingyuan Zhang", title = "On the power of two-dimensional processor arrays with reconfigurable bus systems", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "29--34", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "CRCW shared memory computer; parallel algorithms; PARBS; PARITY problem; power; reconfigurable bus; systems; systolic arrays; two-dimensional processor arrays", treatment = "P Practical", } @Article{Liestman:1991:ASH, author = "A. L. Liestman and T. C. Shermer", title = "Additive spanners for hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "35--42", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220 (Computer architecture)", corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada", countrypub = "Singapore", keywords = "additive spanners; hypercube networks; hypercubes; subnetwork; t-spanner", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Latifi:1991:SEF, author = "S. Latifi", title = "Subcube embeddability of folded hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "43--50", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Dept. of Electr. and Comput. Eng., Nevada Univ., Las Vegas, NV, USA", countrypub = "Singapore", keywords = "allocation; folded hypercubes; hypercube networks; hypercube-based network; n-dimensional hypercube; parallel architectures; processor utilization; subcube", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Sun:1991:PAS, author = "K. T. Sun and H. C. Fu", title = "An {O}(n) parallel algorithm for solving the traffic control problem on crossbar switch networks", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "51--58", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C3360 (Transportation systems); C4230 (Switching theory); C4240P (Parallel programming and algorithm theory); C7420 (Control engineering)", corpsource = "Dept. of Comput. Sci. and inf. Eng., Nat. Chiao-Tung Univ., Hsin Chu, Taiwan", countrypub = "Singapore", keywords = "computational complexity; conflict-free paths; crossbar; energy function; message packets; networks; NP-complete problem; O(n) parallel algorithm; parallel algorithms; salesman problem; switch networks; switching; time complexity; traffic computer control; traffic control problem; traveling", treatment = "A Application; P Practical", } @Article{Datta:1991:MMT, author = "A. Datta and S. V. Joshi and R. N. Mahapatra", title = "Modelling a morphological thinning algorithm for shared memory {SIMD} computers", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "59--65", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C5260B (Computer vision and picture processing)", corpsource = "Dept. of Electron. and Electr. Commun. Eng., Indian Inst. of Technol., Kharagpur, India", countrypub = "Singapore", keywords = "computerised picture processing; cost complexity; morphological thinning algorithm modelling; shared memory SIMD computers; time complexity", treatment = "P Practical", } @Article{Krizanc:1991:NOP, author = "D. Krizanc", title = "A note on off-line permutation routing on a mesh-connected processor array", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "67--70", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6150C (Switching theory); C4230 (Switching theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA", countrypub = "Singapore", keywords = "mesh-connected processor array; offline permutation routing; packet switching; packets; parallel algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Darte:1991:LSN, author = "A. Darte and L. Khachiyan and Y. Robert", title = "Linear scheduling is nearly optimal", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "73--81", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150N (Distributed systems)", corpsource = "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", keywords = "algorithms; convex domain; fat domains; free greedy schedule; linear scheduling; optimal schedulings; parallel algorithms; scheduling; uniform dependence", treatment = "T Theoretical or Mathematical", } @Article{Xue:1991:SCS, author = "Jingling Xue", title = "Specifying control signals for systolic arrays by uniform recurrence equations", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "83--93", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", countrypub = "Singapore", keywords = "control flow; control signals; correctness; data flow; mapping; necessary and sufficient conditions; optimisation; parallel algorithms; parallel programming; programming; recurrence equations; space-time; specification; systolic arrays; theory; uniform", treatment = "T Theoretical or Mathematical", } @Article{Valero:1991:CSV, author = "M. Valero and T. Lang and J. M. Llaberia and M. Peiron and Navarro and J. J. and E. Ayguade", title = "Conflict-free strides for vectors in matched memories", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "95--102", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6120 (File organisation)", corpsource = "Dept. d'Arquitectura de Computadors, Univ. Politecnica de Catalunya, Barcelona, Spain", countrypub = "Singapore", keywords = "access; conflict-free access; linear transformations; matched memories; out-of-order; parallel programming; skewing; storage management; strides; vector processors; vector registers", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Cosnard:1991:RPL, author = "M. Cosnard and A. Ferreira", title = "On the real power of loosely coupled parallel architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "103--111", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "LIP-IMAG/CNRS, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", keywords = "abstract models; complexity theory; computational complexity; concurrent read/write access; Hypercube Random Access Machine; loosely coupled parallel architectures; machines; memory parallel computers; parallel; parallel architectures; parallel machines; PRAM; SIMD distributed", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Manzini:1991:LSR, author = "G. Manzini", title = "Large sorting and routing problems on the {Hypercube} and related networks", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "113--124", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory)", corpsource = "Scuola Normale Superior, Pisa, Italy", countrypub = "Singapore", keywords = "algorithms; bounds; butterfly network; computational complexity; cube connected cycles network; hypercube network; hypercube networks; integer sorting; lower bounds; packet routing; parallel; shuffle network; sorting; upper", treatment = "T Theoretical or Mathematical", } @Article{Ranawake:1991:LBC, author = "U. A. Ranawake and P. M. Lenders and S. M. Goodnick", title = "On lower bounds for the communication volume in distributed systems", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "125--133", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4140 (Linear algebra); C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Electr. and Comput. Eng., Oregon State Univ., Corvallis, OR, USA", countrypub = "Singapore", keywords = "adjacency; communication volume; computational complexity; distributed processor system; eigenvalues; eigenvalues and eigenfunctions; graph theory; graphs; hypercube multiprocessor; hypercube networks; lower bound; lower bounds; matrix; matrix algebra; processor graph; task", treatment = "T Theoretical or Mathematical", } @Article{Yang:1991:IMM, author = "S. B. Yang and S. K. Dhall and S. Lakshmivarahan", title = "An improved maximal matching algorithm", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "135--142", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Sch. of Electr. Eng. and Comput. Sci., Oklahoma Univ., OK, USA", countrypub = "Singapore", keywords = "computational complexity; edges; EREW PRAM; graph theory; parallel algorithms; randomized parallel maximal matching algorithm; undirected graph; vertices", treatment = "T Theoretical or Mathematical", } @Article{Akl:1991:CDP, author = "S. G. Akl and T. Duboux and I. Stojmenovic", title = "Constant delay parallel counters", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "143--148", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "array; binary counters; constant delay parallel counters; constant size memory; cost-; decimal counters; lexicographic order; linear; optimal parallel algorithm; parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Ben-Asher:1991:RRN, author = "Y. Ben-Asher", title = "Ranking on reconfigurable networks", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "149--156", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Haifa Univ., Israel", countrypub = "Singapore", keywords = "data reduction; dynamically reconfiguring machines; multiprocessor interconnection networks; parallel algorithms; parallel operations; performance; ranking; ranking algorithm; reconfigurable mesh; reconfigurable networks; sorting", treatment = "T Theoretical or Mathematical", } @Article{Tan:1991:PMJ, author = "Kian-Lee Tan and Hongjun Lu", title = "On processing multi-joins in parallel systems", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "157--164", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C4250 (Database theory); C6110P (Parallel programming); C6160D (Relational DBMS)", corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of Singapore, Singapore", countrypub = "Singapore", keywords = "completion time; concurrently executed; database theory; multiple joins; parallel algorithms; parallel programming; parallel systems; relational databases; tasks", treatment = "T Theoretical or Mathematical; X Experimental", } @Article{Bermond:1992:CLP, author = "J.-C. Bermond and P. Hell and J.-J. Quisquater", title = "Construction of large packet radio networks", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "3--12", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6230 (Switching centres and equipment); B6250 (Radio links and equipment); C4230M (Multiprocessor interconnection)", corpsource = "CNRS, Nice Univ., Valbonne, France", countrypub = "Singapore", keywords = "chromatic index; digraphs; directed graphs; graphs; hypercube networks; hypercubes; large packet radio networks; multiplexing; packet radio networks; telecommunication networks; time division; time division multiplexing", treatment = "P Practical", } @Article{Feldmann:1992:CCN, author = "R. Feldmann and W. Unger", title = "The cube-connected cycles network is a subgraph of the {Butterfly} network", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "13--19", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Dept. of Math. and Comput. Sci., Paderborn Univ., Germany", countrypub = "Singapore", keywords = "Butterfly network; cube-connected; cycles network; data structures; hypercube networks; n-dimensional; n-dimensional DeBruijn network; parallel architectures; shuffle-exchange network; subgraph", treatment = "P Practical", } @Article{Flatebo:1992:DDD, author = "M. Flatebo and A. K. Datta", title = "Distributed deadlock detection algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "21--30", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems); C6150N (Distributed systems)", corpsource = "Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA", countrypub = "Singapore", keywords = "concurrency control; distributed deadlock detection algorithm; distributed processing; loosely connected; probes; state machines; system recovery", treatment = "P Practical", } @Article{delaTorre:1992:OTR, author = "P. {de la Torre} and R. Greenlaw and T. M. Przytycka", title = "Optimal tree ranking is in {NC}", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "31--41", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA", countrypub = "Singapore", keywords = "complete; computational complexity; CREW PRAM; labeling; optimal tree ranking; P-; parallel algorithms; sequential algorithm; structures; super critical numbering problem; tree data", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Lindon:1992:DAA, author = "L. F. Lindon", title = "Discriminating analysis and its application to matrix by vector multiplication on the {PRAM}", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "43--50", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "access requests; computational complexity; discriminating analysis; optimal algorithm; parallel algorithms; performance measure; pipelining; PRAM; random-access; storage; vector multiplication", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Purushotham:1992:PEL, author = "B. V. Purushotham and A. Basu and P. S. Kumar and L. M. Patnaik", title = "Performance estimation of {LU} factorisation on message passing multiprocessors", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "51--60", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing)", corpsource = "Centre for Dev. of Adv. Comput., Bangalore, India", countrypub = "Singapore", keywords = "analytical model; characteristics; computation-communication; distributed memory; distributed memory systems; evaluation; LU factorisation; message passing; multiprocessors; parallel execution time; performance; performance estimation; pipelined ring algorithm; speedup", treatment = "P Practical", } @Article{Griebel:1992:CTS, author = "M. Griebel", title = "The combination technique for the sparse grid solution of {PDEs} on multiprocessor machines", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "61--70", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4170 (Differential equations); C4240 (Programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C7310 (Mathematics)", corpsource = "Inst. fur Inf., Tech. Univ. Munchen, Germany", countrypub = "Singapore", keywords = "computational complexity; CRAY Y-MP; mathematics computing; multiprocessing systems; multiprocessor machines; parallel complexity; parallelization; partial differential equations; PDEs; sparse grid solution; Transputer system", treatment = "A Application; P Practical", } @Article{Kim:1992:RMS, author = "Do-Hyung Kim and Kwang-Moo Choe and Taisook Han", title = "Refined mark(s)-set-based backtrack literal selection for {AND} parallelism in logic programs", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "71--79", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110L (Logic programming)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Taejon, South Korea", countrypub = "Singapore", keywords = "data structure; logic programming; logic programs; mark(s)-set-based backtrack literal selection; parallel algorithms; parallelism", treatment = "P Practical", } @Article{Ullman:1992:MBP, author = "S. Ullman and B. Narahari", title = "Mapping binary precedence trees to hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "81--87", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "David Taylor Res. Center, Bethesda, MD, USA", countrypub = "Singapore", keywords = "(mathematics); binary precedence trees mapping; execution time; graph; hypercube networks; hypercubes; linear time procedure; optimal; parallel architectures; parallel computer; precedence; processing elements; task precedence; trees; unit dilation cost", treatment = "P Practical", } @Article{Krishnamurti:1992:OSA, author = "R. Krishnamurti and B. Narahari", title = "Optimal subcube assignment for partitionable hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "89--95", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Vancouver, BC, Canada", countrypub = "Singapore", keywords = "hypercube multiprocessor; hypercube networks; optimal subcube assignment; parallel architectures; partitionable hypercubes; processor assignment problem", treatment = "P Practical", } @Article{Myoupo:1992:SLS, author = "J. F. Myoupo", title = "Synthesizing linear systolic arrays for dynamic programming problems", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "97--110", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C5220P (Parallel architecture)", corpsource = "Lab. de Recherche en Inf., Univ. Paris-Sud, Orsay, France", countrypub = "Singapore", keywords = "dynamic programming; geometric considerations; local memory; modular linear systolic arrays design; parallel algorithms; problems; systolic arrays; time delay", treatment = "A Application; P Practical", } @Article{Aly:1992:RPC, author = "K. A. Aly and P. W. Dowd", title = "Reconfigurable parallel computer architecture based on wavelength-division multiplexed optical interconnection network", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "117--127", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5270 (Optical computing techniques)", corpsource = "Dept. of Electr. and Comput. Eng., State Univ. of New York, Buffalo, NY, USA", countrypub = "Singapore", keywords = "congestion; cumulative switching; division multiplexing; edge dilation; latencies; multiple-domain wavelength-division; multiplexed; network; optical interconnection network; optical interconnections; parallel architectures; reconfigurability; structure; wavelength", treatment = "P Practical", } @Article{Rai:1992:RTF, author = "S. Rai and J. L. Trahan", title = "A reconfiguration technique for fault tolerance in a hypercube", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "129--138", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA", countrypub = "Singapore", keywords = "complexity; computational complexity; fault tolerance; fault tolerant computing; fault-free subcube; hypercube; hypercube architecture; hypercube networks; reconfiguration technique", treatment = "T Theoretical or Mathematical", } @Article{Corradi:1992:LBS, author = "A. Corradi and L. Leonardi and F. Zambonelli", title = "Load balancing strategies for massively parallel architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "139--148", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dipartimento di Elettronica, Inf. e Sistemistica, Bologna Univ., Italy", countrypub = "Singapore", keywords = "allocation; architectures; load balancing; massively parallel; object migration; parallel algorithms; parallel architectures; resource", treatment = "T Theoretical or Mathematical", } @Article{Hsu:1992:EML, author = "Wen-Jing Hsu and C. V. Page", title = "Embedding mesh in a large family of graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "149--155", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection)", corpsource = "Dept. of Comput. Technol., Nanyang Technol. Univ., Singapore", countrypub = "Singapore", keywords = "computations; generalized Fibonacci cubes; interconnection network; interconnection networks; mesh embedding; multiprocessor interconnection networks; nearest-neighbor connections; parallel; parallel computer; parallel processing", treatment = "T Theoretical or Mathematical", } @Article{Olariu:1992:PAF, author = "S. Olariu and Z. Wen", title = "A parallel algorithm for forest reconstruction", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "157--160", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "computational complexity; consistency checking; database design; database theory; databases; directed forest; distributed; distributed databases; EREW-PRAM; forest; integer; leaf-to-root paths; parallel algorithm; parallel algorithms; reconstruction; sorting; time complexity; tree data structures", treatment = "T Theoretical or Mathematical", } @Article{Yang:1992:PEM, author = "C. S. Yang and Y. M. Tsai and C. Y. Liu", title = "Performance evaluation of multicast wormhole routing in {2D-Torus} multicomputers", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "161--170", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C6150N (Distributed systems)", corpsource = "Dept. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan", countrypub = "Singapore", keywords = "2D-Torus multicomputers; communication; communication complexity; deadlock-free; evaluation; message routing; multicast; multicast wormhole routing; multicomputer systems; multiprocessing systems; multiprocessor interconnection networks; performance; traffic; wormhole routing", treatment = "T Theoretical or Mathematical", } @Article{Sur:1992:SDA, author = "S. Sur and P. K. Srimani", title = "A self-stabilizing distributed algorithm to construct {BFS} spanning trees of a symmetric graph", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "171--179", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Colorado State Univ., Ft. Collins, CO, USA", countrypub = "Singapore", keywords = "breadth first search; distributed algorithm; distributed processing; graph; graph theory; parallel algorithms; search problems; self-stabilizing; spanning trees; symmetric graph; theoretical reasoning", treatment = "T Theoretical or Mathematical", } @Article{Haglin:1992:AMS, author = "D. J. Haglin", title = "Approximating maximum {2-CNF} satisfiability", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "181--187", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Mankato State Univ., MN, USA", countrypub = "Singapore", keywords = "approximation algorithm; computational complexity; CREW PRAM; maximum 2-CNF satisfiability; parallel; parallel algorithms; satisfiability", treatment = "T Theoretical or Mathematical", } @Article{Sarnath:1992:DLH, author = "R. Sarnath", title = "{DTML} is logspace hard under {NC\slash} sup 1\slash{} reductions", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "189--193", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA", countrypub = "Singapore", keywords = "computational complexity; Different Than Majority; Labeling; logspace hard; NC; NC/sup 1/ reductions; parallel algorithms; polynomial time algorithm", } @Article{Gastaldo:1992:TCP, author = "M. Gastaldo and M. Morvan and J. M. Robson", title = "Transitive closure in parallel on a linear network of processors", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "195--203", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "IMAG, Ecole Normale Superieure, Lyon, France", countrypub = "Singapore", keywords = "closure; complexity; computational complexity; graph theory; linear network; linear time parallel algorithm; neighbouring communications; parallel algorithms; transitive", treatment = "T Theoretical or Mathematical", } @Article{Parberry:1992:PSN, author = "I. Parberry", title = "The pairwise sorting network", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "205--211", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA", countrypub = "Singapore", keywords = "computational complexity; lexicographic order; odd-even sorting; pairwise sorting network; parallel algorithms; principle; sorting; zero-one", treatment = "T Theoretical or Mathematical", } @Article{Kutylowski:1992:PST, author = "M. Kutylowski and R. Wanka", title = "Periodic sorting on two-dimensional meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "213--220", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Heinz-Nixdorf-Inst., Univ.-GH Paderborn, Germany", countrypub = "Singapore", keywords = "2D processor mesh; computational complexity; parallel algorithms; periodic sorting; procedure; snake-like ordering; sorting; two-dimensional meshes", treatment = "T Theoretical or Mathematical", } @Article{Berthome:1992:EKH, author = "P. Berthome", title = "Efficient {K}-selection in hypercube multiprocessors", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "221--230", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Lab. de l'Inf. du Parallelisme, Ecole Normale Superieure, Lyon, France", countrypub = "Singapore", keywords = "algorithms; computational complexity; hypercube multiprocessors; hypercube networks; K-selection; parallel; recursive strategy", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Akl:1992:SOS, author = "S. G. Akl and I. Stojmenovic", title = "A simple optimal systolic algorithm for generating permutations", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "231--239", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "algorithms; combinatorial; combinatorial mathematics; computational complexity; constant delay per permutation; constant size memory; cost-optimal; generating permutations; linear array; parallel algorithm; parallel algorithms; permutation generation; processor array; systolic algorithm; systolic arrays", treatment = "T Theoretical or Mathematical", } @Article{Elhage:1992:SGC, author = "H. Elhage and I. Stojmenovic", title = "Systolic generation of combinations from arbitrary elements", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "241--248", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada", countrypub = "Singapore", keywords = "combinations generation; combinatorial mathematics; combinatorial objects generation; computational complexity; constant; constant delay per combination; cost-optimal; lexicographically ascending order; linear array; parallel algorithms; processor array; size memory; systolic algorithm; systolic arrays", treatment = "T Theoretical or Mathematical", } @Article{Bhagavathi:1992:CPP, author = "D. Bhagavathi and S. Olariu and J. L. Schwing and J. Zhang", title = "Convex polygon problems on meshes with multiple broadcasting", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "249--256", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "algorithms; column buses; computational complexity; computational geometry; computers; containment; convex n-gons; convex polygon problems; convexity; edge-intersect; intersection; lower bound; mesh connected; meshes with; multiple broadcasting; optimal algorithms; parallel; row buses; separability; time-; union", treatment = "T Theoretical or Mathematical", } @Article{Ali:1992:PPM, author = "A. T. Ali and E. L. Dagless", title = "A parallel processing model for real-time computer vision-aided road traffic monitoring", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "257--264", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5260B (Computer vision and picture processing); C7130 (Public administration)", corpsource = "Adv. Comput. Res. Centre, Bristol Univ., UK", countrypub = "Singapore", keywords = "computer vision; computerised monitoring; extraction; image data analysis; model; motorway; multi-lane carriageway; parallel; parallel processing; processing; real-time; real-time computer vision; real-time systems; road traffic; road traffic monitoring; roadway scenes; systems; traffic; traffic analysis; traffic data; transputer; transputer networks; transputer-based; video images", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wong:1992:MSP, author = "W. F. Wong and C. K. Yuen", title = "A model of speculative parallelism", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "265--272", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of Singapore, Singapore", countrypub = "Singapore", keywords = "BaLinda; control parallelism; Lisp; LISP; Lisp; parallel programming; simulation; speculative parallelism", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Barnett:1992:UPL, author = "M. Barnett and C. Lengauer", title = "Unimodularity and the parallelization of loops", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "273--281", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", corpsource = "Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA", countrypub = "Singapore", keywords = "loop parallelization; loop transformations; parallel algorithms; parallel programming; parallelizing compiler; program compilers; space-time; systolic arrays; transformation; unimodularity", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bouabdallah:1992:IMM, author = "A. Bouabdallah and J.-C. Konig", title = "An improvement of {Maekawa}'s mutual exclusion algorithm to make it fault-tolerant", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "283--290", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150N (Distributed systems)", corpsource = "CNRS, Univ. de Paris-Sud, Orsay, France", countrypub = "Singapore", keywords = "communication complexity; distributed algorithms; distributed systems; fault-tolerant; mutual exclusion; node failures; recovery procedure; shared resource", treatment = "T Theoretical or Mathematical", } @Article{Doroshenko:1992:AAD, author = "A. E. Doroshenko", title = "On asynchronous avoidance of deadlocks in parallel programs", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "291--297", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150N (Distributed systems)", corpsource = "V. M. Glushkov Cybernet. Inst., Acad. of Sci., Kiev, Ukraine", countrypub = "Singapore", keywords = "asynchronous communication; asynchronous data; buffering; communicating sequential; concurrency control; CPS; data dependence analysis; deadlock avoidance; exchanges; multimodule programs; parallel programming; parallel programs; programs", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Galbiati:1992:CEP, author = "G. Galbiati and F. Maffioli", title = "Constructing an exact parity base is in {RCN\slash} sup 2", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "301--309", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dipartimento di Inf. e Sistemistica, Pavia Univ., Italy", countrypub = "Singapore", keywords = "0-1 weighted; bounded fan-in circuits; combinatorial mathematics; combinatorial problems; computational complexity; existence; matroid; parallel algorithms; parallel complexity; parity base; perfect matching; polynomial size; preassigned weight; quadratic logarithmic depth; RNC/sup 2/", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Carlsson:1992:PCH, author = "S. Carlsson and J. Chen", title = "Parallel constructions of heaps and min-max heaps", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "311--320", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1140C (Queueing theory); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Lulea Univ. of Technol., Sweden", countrypub = "Singapore", keywords = "comparison tree model; heaps; min-max heaps; parallel; parallel algorithms; parallel constructions; priority; priority deques; queueing theory; queues; tree data structures", treatment = "P Practical", } @Article{Albacea:1992:CLE, author = "E. A. Albacea", title = "Computation list evaluation and its applications", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "321--329", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia", countrypub = "Singapore", keywords = "algorithm; computation list evaluation; Euler; list ranking; parallel algorithms; problem instances; three contraction; Tour technique; tree data structures", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bossomaier:1992:DPC, author = "T. Bossomaier and N. Isidoro and A. Loeff", title = "Data parallel computation of {Euclidean} distance transforms", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "331--339", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry); C6120 (File organisation)", corpsource = "Res. Sch. of Phys. Sci. and Eng., Australian Nat. Univ., Canberra, ACT, Australia", countrypub = "Singapore", keywords = "algorithms; computational geometry; data parallel computation; data sets; data structures; Euclidean distance transforms; graphics; image processing; maximum error; parallel; parallel algorithms; parallel computers; pattern; recognition; SIMD machines", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chlebus:1992:TSA, author = "B. Chlebus", title = "Two selection algorithms on a mesh-connected computer", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "341--346", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Instytut Informatyki, Warszawski Univ., Warszawa, Poland", countrypub = "Singapore", keywords = "complexity bound; computational complexity; deterministic selection algorithms; mesh-connected computer; model of computation; parallel; parallel algorithms; processing; processor array", treatment = "P Practical", } @Article{Duato:1992:CCN, author = "J. Duato", title = "Channel classes: a new concept for deadlock avoidance in wormhole networks", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "347--354", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6150P (Network design and planning); C4230M (Multiprocessor interconnection); C5620 (Computer networks and techniques); C6150J (Operating systems)", corpsource = "Fac. de Inf., Univ. Politecnica de Valencia, Spain", countrypub = "Singapore", keywords = "adaptive algorithm; channel classes; concurrency control; cyclic dependencies; deadlock avoidance; deadlock-free adaptive routing algorithms; equivalence relation; forward; interconnection networks; message passing; multiprocessor; order; partial; store-and-; verification; wormhole networks", treatment = "P Practical", } @Article{Pelc:1992:BTS, author = "A. Pelc", title = "Broadcasting time in sparse networks with faulty transmissions", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "355--361", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6210 (Telecommunication applications); C5620 (Computer networks and techniques); C5670 (Network performance)", corpsource = "Dept. d'Inf., Univ. Quebec a Hull, Que., Canada", countrypub = "Singapore", keywords = "bounded number of failures; broadcasting time; communication network; computer networks; fault tolerant computing; fault-tolerant broadcasting; faulty transmissions; independent failures; random; sparse networks; telecommunication networks", treatment = "P Practical", } @Article{Bampis:1992:LOS, author = "E. Bampis and J.-C. Konig and D. Trystram", title = "A low overhead schedule for a {3D-grid} graph", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "363--372", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150J (Operating systems)", corpsource = "LRI, Univ. de Paris Sud, Orsay, France", countrypub = "Singapore", keywords = "3D-grid graph; communication; low overhead schedule; lower bound; overhead; parallel algorithms; scheduling", treatment = "P Practical", } @Article{Lenders:1992:MAA, author = "P. M. Lenders", title = "Multi-rate arrays and affine recurrence equations", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "373--380", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Math. Sci. and Comput. Sci., New England Univ., Armidale, NSW, Australia", countrypub = "Singapore", keywords = "affine recurrence equations; dependency matrix; domain; identity matrix; multirate arrays; null space; parallel algorithms; problem; systolic arrays", treatment = "P Practical", } @Article{DeFalco:1992:SGA, author = "I. {De Falco} and R. {Del Balio} and E. Tarantino and R. Vaccaro", title = "Simulation of genetic algorithms on {MIMD} multicomputers", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "381--389", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C1290 (Applications of systems theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Istit. per la Ricerca sui Sistemi Inf. Paralleli, IRSIP-CNR, Naples, Italy", countrypub = "Singapore", keywords = "fully connected chordal ring topology; genetic algorithm; genetic algorithms; genetic algorithms simulation; MIMD multicomputers; operations research; parallel; parallel algorithms; parallel diffusion processors; PMX crossover; travelling salesman problem", treatment = "P Practical", } @Article{Johnson:1992:PBM, author = "T. Johnson and T. A. Davis", title = "Parallel buddy memory management", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "391--398", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ., Gainesville, FL, USA", countrypub = "Singapore", keywords = "algorithm; allocators; data structures; dynamic storage; parallel algorithms; parallel buddy memory management; parallel programs; parallel sparse matrix; storage management", treatment = "P Practical", } @Article{Sieling:1993:NOB, author = "D. Sieling and I. Wegener", title = "{NC-algorithms} for operations on binary decision diagrams", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "3--12", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230B (Combinatorial switching theory); C4240P (Parallel programming and algorithm theory)", corpsource = "FB Inf., Dortmund Univ., Germany", countrypub = "Singapore", keywords = "binary decision diagrams; Boolean functions; CAD; CAD tools; circuit switching; CRCW COMMON PRAMs; decidability; logarithmic run time; logical synthesis; minimization; NC-algorithms; parallel algorithms; redundancy test; satisfiability; test pattern generation; verification", treatment = "T Theoretical or Mathematical", } @Article{Hsu:1993:MPS, author = "Lih-Hsing Hsu", title = "Matching polynomials of series-parallel graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "13--18", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Inf. and Comput. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan", countrypub = "Singapore", keywords = "(mathematics); complexity; computational complexity; computational geometry; computer; cost-optimal parallel algorithm; EREW PRAM; graph; matching polynomials; parallel algorithms; polynomials; series-parallel graphs; theory; time; tree contraction; trees", treatment = "T Theoretical or Mathematical", } @Article{Bar-Noy:1993:OAC, author = "A. Bar-Noy and S. Kipnis and B. Schieber", title = "An optimal algorithm for computing census functions in message-passing systems", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "19--23", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C6150N (Distributed systems)", corpsource = "T. J. Watson Res. Center, IBM Res. Div., Yorktown Heights, NY, USA", countrypub = "Singapore", keywords = "census computation; census functions; communication rounds; commutative census function; distributed memory systems; distributed-memory; message passing; message-passing; multiprocessing; optimal algorithm; parallel algorithms; parallel computer; parallel computers; programs; systems", treatment = "T Theoretical or Mathematical", } @Article{Tromp:1993:US, author = "J. Tromp", title = "On update-last schemes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "25--28", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6120 (File organisation)", corpsource = "CWI, Amsterdam, Netherlands", countrypub = "Singapore", keywords = "combinatorial; data management; distributed systems; file organisation; index; parallel programming; problems; space complexity; storage management; update-last schemes", treatment = "T Theoretical or Mathematical", } @Article{Charles:1993:SSS, author = "H.-P. Charles and P. Fraigniaud", title = "Scheduling a scattering-gathering sequence on hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "29--42", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5440 (Multiprocessor systems and techniques); C6150N (Distributed systems)", corpsource = "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", keywords = "broadcasting problems; computers; distinct address; distributed memory parallel; distributed memory systems; gossiping; hypercube networks; hypercubes; pipeline; pipelining; processing; scattering problem; scattering-gathering sequence; scheduling", treatment = "T Theoretical or Mathematical", } @Article{Glasa:1993:BSA, author = "J. Glasa", title = "Bit-level systolic arrays for digital contour smoothing by {Abel-Poisson} kernel", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "43--51", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B1265B (Logic circuits); B1265F (Microprocessors and microcomputers); B2570 (Semiconductor integrated circuits); B6140C (Optical information and image processing); C1250 (Pattern recognition); C1260 (Information theory); C5120 (Logic and switching circuits); C5135 (Digital signal processing chips); C5220P (Parallel architecture); C5260B (Computer vision and picture processing)", corpsource = "Inst. of Control Theory and Robotics, Slovak Acad. of Sci., Bratislava, Czechoslovakia", countrypub = "Singapore", keywords = "Abel-; algebra; bit-level systolic arrays; circulant Toeplitz matrices; clock frequency; digital contour smoothing; digital signal processing chips; execution time; functional elements; high; image; image processing; matrix; Poisson kernel; processing; real-time applications; real-time systems; systolic arrays; VLSI", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ali:1993:TCS, author = "H. H. Ali and H. El-Rewini", title = "The time complexity of scheduling interval orders with communication is polynomial", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "53--58", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150N (Distributed systems)", corpsource = "Dept. of Math. and Comput. Sci., Nebraska Univ., Omaha, NE, USA", countrypub = "Singapore", keywords = "algorithms; communication; computational complexity; cost; interval orders; multiprocessing programs; NP-complete; objective function; parallel; parallel programming; parallel programs; polynomial time; polynomial time algorithms; scheduling; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Lin:1993:SEM, author = "R. Lin and S. Olariu and J. L. Schwing and J. Zhang", title = "Simulating enhanced meshes, with applications", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "59--70", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Geneseo, NY, USA", countrypub = "Singapore", keywords = "access storage; Common-CRCW; computational complexity; CREW-; enhanced meshes simulation; function; inverse Ackermann; multiple broadcasting; nontrivial lower bounds; parallel architectures; PRAM; random-; reconfigurable architectures; reconfigurable mesh", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Fragopoulou:1993:ESN, author = "P. Fragopoulou", title = "On the efficient summation of {N} numbers on an {N}-processor reconfigurable mesh", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "71--78", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "architectures; dimensional processor array; N-processor reconfigurable mesh; parallel algorithm; parallel algorithms; parallel architectures; reconfigurable; summation of N numbers; two-", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Olariu:1993:SAL, author = "S. Olariu and W. Shen and L. Wilson", title = "Sub-logarithmic algorithms for the largest empty rectangle problem", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "79--85", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "algorithms; all nearest smaller values problem; Common-CRCW-PRAM model; computational complexity; computational geometry; largest empty rectangle problem; parallel; parallel algorithms; sub-logarithmic algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gastin:1993:ECS, author = "P. Gastin and V. Villain", title = "An efficient crash-tolerant sequential traversal", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "87--97", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5470 (Performance evaluation and testing); C5620 (Computer networks and techniques); C5670 (Network performance)", corpsource = "Inst. Blaise Pascal, Paris VI Univ., France", countrypub = "Singapore", keywords = "agreement; crash-tolerant sequential traversal; distributed processing; distributed systems; fault tolerant computing; identification; termination detection", treatment = "P Practical", } @Article{Virbitskaite:1993:SCN, author = "I. B. Virbitskaite", title = "Some characteristics of nondeterministic processes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "99--106", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4200 (Computer theory)", corpsource = "Inst. of Inf. Syst., Russian Acad. of Sci., Novosibirsk, Russia", countrypub = "Singapore", keywords = "computation theory; crossing; density; discreteness; event structures; graph theory; nondeterministic processes; representations; semantic representations; syntactic", treatment = "T Theoretical or Mathematical", } @Article{Cosnard:1993:EN, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "??--??", month = mar, year = "1993", bibdate = "Mon Nov 09 06:52:25 1998", URL = "http://www.ens-lyon.fr/PPL/vol3_1.html", acknowledgement = ack-nhfb, } @Article{Krizanc:1993:CMS, author = "D. Krizanc and S. Rajasekaran and S. S. Shende", title = "A comparison of meshes with static buses and half-duplex wrap-arounds", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "109--114", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA", countrypub = "Singapore", keywords = "computational powers; half-duplex wrap-arounds; meshes; multiprocessor interconnection networks; packet switching; permutation routing problem; randomized sorting; sorting; static buses; torus", treatment = "P Practical", } @Article{Barth:1993:EMD, author = "D. Barth", title = "Embedding meshes of $d$-ary trees into {de Bruijn} graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "115--127", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "Bordeaux I Univ., Talence, France", countrypub = "Singapore", keywords = "(mathematics); architectures; congestion; constant dilation; de Bruijn graphs; embedding; hypercube networks; meshes of d-ary trees; optimal expansion; parallel; parallel architectures; trees", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Cheung:1993:TLB, author = "S. Cheung and F. C. M. Lau", title = "Time lower bounds for permutation routing on multi-dimensional bused meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "129--138", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci., California Univ., Davis, CA, USA", countrypub = "Singapore", keywords = "bused meshes; multi-dimensional; parallel algorithms; parallel architectures; permutation routing; time lower bounds", treatment = "P Practical", } @Article{Looges:1993:PPC, author = "P. J. Looges and S. Olariu", title = "A practical platform for {CREW} emulation", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "139--145", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6185 (Simulation techniques)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "algorithm; architectures; broadcast delay; concurrent read exclusive write PRAM; CREW emulation; crossbar connected machine; digital simulation; model; parallel; parallel algorithms; parallel random access machine; simulation", treatment = "P Practical", } @Article{Schmeck:1993:PHT, author = "H. Schmeck and H. Schroder and J. Staunstrup and M. Middendorf", title = "Problem heaps and their evaluation", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "147--155", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C6120 (File organisation)", corpsource = "Inst. fur Angewandte Inf. and Formale Beschreibungsverf., Karlsruhe Univ., Germany", countrypub = "Singapore", keywords = "abstract model; algorithms; asynchronous communication; computational complexity; hardware complexity; lower bounds; multiprocessing systems; multiprocessor; parallel; problem heaps; systems; tree data structures", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Thangavel:1993:PAG, author = "P. Thangavel and V. P. Muthuswamy", title = "A parallel algorithm to generate {N}-ary reflected {Gray} codes in a linear array with reconfigurable bus system", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "157--164", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220 (Computer architecture); C6130 (Data handling techniques)", corpsource = "Dept. of Math., Bharathidasan Univ., Tiruchirapalli, India", countrypub = "Singapore", keywords = "array; codes; linear; N-ary reflected gray codes; parallel algorithm; parallel algorithms; reconfigurable architectures; reconfigurable bus system", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chandrasekharan:1993:EPA, author = "N. Chandrasekharan and V. S. Lakshmanan and M. Medidi", title = "Efficient parallel algorithms for finding chordless cycles in graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "165--170", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Math. Sci., Loyola Univ., Chicago, IL, USA", countrypub = "Singapore", keywords = "chordless cycles; graph theory; graphs; parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Pradeep:1993:CTA, author = "B. Pradeep and C. {Siva Ram Murthy}", title = "A constant time algorithm for redundancy elimination in task graphs on processor arrays with reconfigurable bus systems", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "171--177", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Madras, India", countrypub = "Singapore", keywords = "algorithm parallelization; constant time algorithm; graphs; parallel algorithm; parallel algorithms; precedence graph formalism; processor arrays; reconfigurable architectures; reconfigurable bus systems; redundancy elimination; task", treatment = "P Practical", } @Article{Plata:1993:EPA, author = "O. Plata and T. F. Pena and F. F. Rivera and E. L. Zapata", title = "An efficient processor allocation for nested parallel loops on distributed memory hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "179--187", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. Electron. y Computacion, Santiago de Compostela Univ., Spain", countrypub = "Singapore", keywords = "communication; data distribution; distributed memory hypercubes; distributed memory systems; HYPAL; hypercube networks; hypercube partitioning algorithm; message; message-passing hypercubes; nested parallel loops; overhead; passing; processor allocation problem; program compilers; scheduling; static", treatment = "P Practical", } @Article{Chung:1993:NPP, author = "Kuo-Liang Chung and Hsun-Wen Chang", title = "Novel pipelining and processor allocation strategy for monoid computations on unshuffle-exchange networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "189--193", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Inf. Manage., Nat. Taiwan Univ., Taipei, Taiwan", countrypub = "Singapore", keywords = "hypercube network; monoid computations; multiple output nodes; parallel algorithms; parallel architectures; pipelining; processor; processor allocation strategy; scheduling; unshuffle-exchange networks; utilization", treatment = "P Practical", } @Article{Das:1993:DFD, author = "A. Das and K. Thulasiraman and K. B. Lakshmanan and V. K. Agarwal", title = "Distributed fault diagnosis of a ring of processors", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "195--204", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing)", corpsource = "Dept. d'Inf. et de Recherche Oper., Montreal Univ., Que., Canada", countrypub = "Singapore", keywords = "bidirectional rings; distributed fault diagnosis; fault tolerant computing; faulty processors; level diagnosis; multiprocessing systems; ring of processors; system; unidirectional rings", treatment = "P Practical", } @Article{Greenlaw:1993:BSP, author = "R. Greenlaw", title = "Breadth-depth search is {P}-complete", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "209--222", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA", countrypub = "Singapore", keywords = "branch-and-bound strategies; breadth-depth search; breadth-first search; complexity; computational complexity; decision problem; depth-first search; fixed ordered adjacency; lists; P-complete; parallel algorithms; parallel complexity; problems; search; search strategy; sequential; vertex numbers", treatment = "T Theoretical or Mathematical", } @Article{Caceres:1993:FET, author = "E. N. Caceres and N. Deo and S. Sastry and J. L. Szwarcfiter", title = "On finding {Euler Tours} in parallel", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "223--231", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA", countrypub = "Singapore", keywords = "CREW PRAM; Euler Tours; graph; graph theory; parallel algorithm; parallel algorithms; stitching; strut; vertices", treatment = "T Theoretical or Mathematical", } @Article{Raman:1993:UAP, author = "A. Raman and C. {Pandu Rangan}", title = "A unified approach to parallel algorithms for the domatic partition problem on special classes of perfect graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "233--241", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., IIT, Madras, India", countrypub = "Singapore", keywords = "block graphs; domatic partition problem; dominating set; graph theory; graphs; interval graphs; K-trees; parallel algorithms; perfect; set of vertices; vertex set", treatment = "T Theoretical or Mathematical", } @Article{Kulkarni:1993:PPA, author = "R. Kulkarni and S. Date and B. Kulkarni and U. Kulkarni and A. S. Kolaskar", title = "{PRAS}: parallel alignment of sequences algorithm", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "243--252", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "A8710 (General, theoretical, and mathematical biophysics); C1290L (Biology and medicine); C4240P (Parallel programming and algorithm theory); C7330 (Biology and medicine)", corpsource = "Centre for Dev. of Adv. Comput., Pune Univ., India", countrypub = "Singapore", keywords = "algorithm; algorithms; dynamic programming; loosely-coupled MIMD; molecular biology; molecular biophysics; multiple alignment of sequences; nucleic acids; parallel; parallel alignment; PRAS; proteins; series (mathematics); strings; transputer; transputer-based multiprocessor", treatment = "T Theoretical or Mathematical", } @Article{Fon-Der-Flaass:1993:CIG, author = "D. Fon-Der-Flaass and I. Rival", title = "Collecting information in graded ordered sets", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "253--260", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection)", corpsource = "Inst. of Math., Acad. of Sci., Novosibirsk, Russia", countrypub = "Singapore", keywords = "finite ordered set; graded ordered sets; immediate; immediate predecessors; information transmission; multiprocessing systems; precedence constraints; predecessors; set theory; successors", treatment = "T Theoretical or Mathematical", } @Article{Schwabe:1993:OVD, author = "E. J. Schwabe", title = "Optimality of a {VLSI} decomposition scheme for the {deBruijn} graph", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "261--265", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); B1110 (Network topology); B1130 (General analysis and synthesis methods)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern Univ., Evanston, IL, USA", countrypub = "Singapore", keywords = "building blocks; circuit layout; connections; deBruijn graph; graph edges; graphs; individual chips; inter-chip; optimisation; structured subgraphs; VLSI; VLSI decomposition", treatment = "T Theoretical or Mathematical", } @Article{Xirouchakis:1993:DPV, author = "P. C. Xirouchakis and P. Y. Wang and O. Frieder", title = "Data parallel visual reconstruction and partitioning algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "267--277", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5260B (Computer vision and picture processing)", corpsource = "JJMA Inc., Virginia, VA, USA", countrypub = "Singapore", keywords = "algorithmic complexities; data; data parallel algorithms; discontinuities; Distributed Array Processor; finite element algorithms; image; image reconstruction; interacting step; parallel; parallel algorithms; partitioning algorithm; processing; V-RAM; visual reconstruction", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wang:1993:POR, author = "P. S. P. Wang", title = "Parallel object representation and recognition", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "279--290", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5260B (Computer vision and picture processing)", corpsource = "Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA", countrypub = "Singapore", keywords = "3-dimensional; computer vision; coordinated graph; image analysis problems; image processing; image recognition; layered graph; object recognition; object representation; parallel algorithms; parallel matching; parallel method; parallel parsing; representation", treatment = "T Theoretical or Mathematical", } @Article{Higham:1993:PMA, author = "L. Higham and E. Schenk", title = "{PRAM} memory allocation and initialization", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "291--299", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Calgary Univ., Alta., Canada", countrypub = "Singapore", keywords = "algorithms; CREW PRAM; EREW PRAM; managing memory; memory allocation; memory initialization; memory management; parallel; parallel algorithms; parallel machines; parallel random access machine; PRAM; storage management", treatment = "T Theoretical or Mathematical", } @Article{Fragopoulou:1993:CPC, author = "P. Fragopoulou", title = "On the comparative powers of the {2D-PARBS} and the {CRCW-PRAM} models", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "301--304", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "2D-PARBS; comparative powers; complexity; computational needs; CRCW-PRAM; evaluation; global shared memory; parallel algorithms; parallel computation; parallel processing; parallel random access machine; PARITY problem; performance; reconfigurable bus; system", treatment = "T Theoretical or Mathematical", } @Article{Mackenzie:1993:LBO, author = "P. D. Mackenzie", title = "A lower bound for order-preserving broadcast in the postal model", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "313--320", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C6150N (Distributed systems)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", countrypub = "Singapore", keywords = "broadcasting; communication complexity; communication network; distributed memory systems; lower bound; message passing; message passing systems; multiple messages; order-preserving broadcast; order-preserving fashion; parallel algorithms; postal model", treatment = "T Theoretical or Mathematical", } @Article{Duato:1993:DDA, author = "J. Duato", title = "On the design of deadlock-free adaptive multicast routing algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "321--333", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Fac. de Inf., Univ. Politecnica de Valencia, Spain", countrypub = "Singapore", keywords = "2D-mesh; concurrency control; cyclic; deadlock-free adaptive multicast routing algorithms; dependencies; hypercube networks; hypercube topologies; multicast communication; sufficient conditions; system recovery; wormhole networks", treatment = "P Practical", } @Article{Bruck:1993:EGC, author = "J. Bruck and Ching-Tien Ho", title = "Efficient global combine operations in multi-port message-passing systems", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "335--346", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C6150N (Distributed systems)", corpsource = "Res. Div., IBM Almaden Res. Center, San Jose, CA, USA", countrypub = "Singapore", keywords = "associative reduction function; global combine operations; message passing; multiport message-passing; parallel processing; systems", treatment = "P Practical", } @Article{Liestman:1993:PG, author = "A. L. Liestman and D. Richards", title = "Perpetual gossiping", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "347--355", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6210L (Computer communications); C5620 (Computer networks and techniques); C7220 (Generation, dissemination, and use of information)", corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada", countrypub = "Singapore", keywords = "computer networks; gossiping; information dissemination; information dissemination problem", treatment = "P Practical", } @Article{Fujita:1993:OGM, author = "S. Fujita and M. Yamashita", title = "Optimal gossiping in mesh-bus computers", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "357--361", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "Dept. of Electr. Eng., Hiroshima Univ., Japan", countrypub = "Singapore", keywords = "mesh-bus computers; optimal algorithm; optimal gossiping; parallel processing", treatment = "P Practical", } @Article{Daniel:1993:SPM, author = "F. Daniel and G. Authie", title = "Shortest paths multiplicity in generalized {de Bruijn} and {Kautz} networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "363--374", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Lab. d'Automatique et d'Analyse des Syst., Toulouse, France", countrypub = "Singapore", keywords = "communication issues; generalized de Bruijn networks; hypercube networks; Kautz networks; residue calculation; shortest paths multiplicity; vertex-couples", treatment = "T Theoretical or Mathematical", } @Article{Rowley:1993:NAH, author = "R. Rowley and B. Bose", title = "On the number of arc-disjoint {Hamiltonian} circuits in the {de Bruijn} graph", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "375--380", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA", countrypub = "Singapore", keywords = "arc-disjoint Hamiltonian circuits; constructive proof; d-ary De Bruijn graph; Hamiltonian circuits; hypercube networks", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Farley:1993:SN, author = "A. M. Farley and A. Proskurowski", title = "Self-repairing networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "381--391", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6210 (Telecommunication applications); C5670 (Network performance)", corpsource = "Oregon Univ., Eugene, OR, USA", countrypub = "Singapore", keywords = "algorithmic; associated routing tables; communication; delay; determination; fault tolerant computing; information dissemination; message transfer; networks; self-repairing graphs; self-repairing networks; specification; telecommunication networks", treatment = "P Practical", } @Article{Auletta:1993:FTR, author = "V. Auletta and A. A. Rescigno and V. Scarano", title = "Fault tolerant routing in the {Supercube}", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "393--405", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5670 (Network performance)", corpsource = "Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy", countrypub = "Singapore", keywords = "connectivity; fault tolerant computing; fault tolerant routing; hypercube; hypercube networks; interconnection network; route graph; Supercube", treatment = "P Practical", } @Article{Subramonian:1993:EMB, author = "R. Subramonian and N. Venkatasubramanyan", title = "Efficient multiple-item broadcast in the {logP} model", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "407--417", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", countrypub = "Singapore", keywords = "logP model; multiple-item broadcast; multiprocessing systems; multiprocessors; optimal solution; parallel algorithms; performance degradation; point-to-point message transmission", treatment = "P Practical", } @Article{Malard:1993:DRD, author = "J. Malard and C. C. Paige", title = "Data replication in dense matrix factorization", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "419--430", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C5670 (Network performance)", corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", countrypub = "Singapore", keywords = "communication primitive; data replication; dense matrix factorization; gossiping; hypercube; hypercube networks; LU factorization algorithms; message passing; message passing multicomputer; numerical software libraries; performance evaluation; performance gains", treatment = "P Practical", } @Article{Pellegrini:1993:BBD, author = "F. Pellegrini", title = "Bounds for the bandwidth of the $d$-ary {de Bruijn} graph", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "431--443", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "CNRS, Bordeaux I Univ., Talence, France", countrypub = "Singapore", keywords = "binary hypercube; binary values; bisection; continuous domain; d-ary de Bruijn graph; equivalent proof; extended; graph theory; Hamming codes; Hamming weight; Hamming weights; hypercube networks; hypercube vertices; Laplace; non-binary case; numbering system; theorem; unoriented de Bruijn graph; vertex-", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Fiol:1993:UAD, author = "M. A. Fiol and J. Fabrega and O. Serra and J. L. A. Yebra", title = "A unified approach to the design and control of dynamic memory networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "445--456", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C6120 (File organisation)", corpsource = "Dept. de Matematica Aplicada i Telematica, Univ. Politecnica de Catalunya, Barcelona, Spain", countrypub = "Singapore", keywords = "access time; cyclic shift registers; dynamic memory networks; fast; interconnection network; interconnection schemes; interconnection topologies; memory control; memory organizations; multiprocessor interconnection networks; sequential access; shift registers; small access times; storage management; storage medium; unified approach", treatment = "P Practical", } @Article{Cai:1993:DBS, author = "Leizhen Cai and J. M. Keil", title = "Degree-bounded spanners", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "457--468", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada", countrypub = "Singapore", keywords = "communication networks; complexity; computation; computational complexity; degree-bounded spanners; distributed systems; graph theory; NP-complete; parallel; spanning subgraph; t-spanner", treatment = "T Theoretical or Mathematical", } @Article{Arruabarrena:1993:PEA, author = "A. Arruabarrena and R. Beivide and C. Izu and J. Miguel", title = "A performance evaluation of adaptive routing in bidimensional cut-through networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "469--484", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Konputagailuen Arkitektura eta Teknologia Saila, Euskal Herriko Univ., Donostia, Spain", countrypub = "Singapore", keywords = "adaptive routing; average; avoidance; bidimensional cut-; communication network; concurrency control; deadlock; evaluation; massively parallel; maximum sustained throughput; mesh; message flow control; message latency; network topology; parallel architectures; performance; performance evaluation; processor; telecommunication network routing; through networks; torus", treatment = "P Practical", } @Article{Jesshope:1993:LRV, author = "C. Jesshope", title = "Latency reduction in {VLSI} routers", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "485--494", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Electron. and Electr. Eng., Surrey Univ., Guildford, UK", countrypub = "Singapore", keywords = "computers; fault tolerant computing; latency reduction; MPI router chip; parallel; parallel architectures; performance evaluation; scalable performance; VLSI; VLSI routers", treatment = "P Practical", } @Article{Fiorini:1993:XOP, author = "P. Fiorini", title = "The {XOmega} and the {Omega} pyramids, a new family of competitive interconnection networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "495--506", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "Lab. Syst. de Perception, Centre de Recherches et d'Etudes d'Arcueil, France", countrypub = "Singapore", keywords = "distributed memory systems; interconnection networks; massively; multiprocessor interconnection; networks; Omega pyramids; parallel computers; XOmega", treatment = "P Practical", } @Article{Clausen:1994:DIS, author = "Jens Clausen and Jesper Larsson Traeff", title = "Do inherently sequential branch-and-bound algorithms exist?", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "3--13", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Copenhagen", affiliationaddress = "Copenhagen, Den", classification = "721.1; 921.4; 921.5; C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Copenhagen Univ., Denmark", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; Algorithms; Branch-and-Bound paradigm; Computational complexity; Graph partitioning problem; Graph Partitioning Problem; Graph theory; implementation; Inherently sequential branch and bound algorithm; NP-hard optimization; optimisation; Optimization; parallel; parallel algorithms; search problems", treatment = "T Theoretical or Mathematical", } @Article{Das:1994:SDR, author = "Sajal K. Das and Ranette H. Halverson", title = "Simple deterministic and randomized algorithms for linked list ranking on the {EREW} {PRAM} model", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "15--27", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of North Texas", affiliationaddress = "Denton, TX, USA", classification = "721.1; 722.4; 723.1; 921.5; 921.6; 922.1; C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; algorithms; APRAM; asynchronous CRCW PRAM; Computational complexity; computational complexity; deterministic algorithm; EREW Parallel Random Access Machines (PRAM) model; EREW PRAM model; Exclusive Read Exclusive Write (EREW) PRAM; linked list; Linked list ranking; list processing; list ranking algorithms; Mathematical models; Optimization; parallel; Parallel algorithm; Parallel processing systems; Program processors; Random access storage; Random processes; Randomized algorithm; randomized algorithms; ranking; space complexity; Space requirements; Storage allocation (computer); Time complexity; time complexity; Work optimality", treatment = "T Theoretical or Mathematical", xxtitle = "Simple deterministic randomized algorithms for linked list ranking on the {EREW} {PRAM} model", } @Article{Yang:1994:PEC, author = "S. B. Yang and S. K. Dhall and S. Lakshmivarahan", title = "A processor efficient connectivity algorithm on random graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "29--36", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Oklahoma", affiliationaddress = "Norman, OK, USA", classification = "722.1; 722.4; 723.1; 921.4; 921.6; 922.1; C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Oklahoma Univ., Norman, OK, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Computational complexity; computational complexity; Connected components; Connectivity algorithm; connectivity algorithm; EREW Parallel Random Access Machines (PRAM) model; EREW PRAM; EREW PRAM model; Exclusive Read Exclusive Write (EREW) PRAM; Graph theory; graph theory; Mathematical models; parallel algorithm; parallel algori