BIT - researchr journal

researchr

You are not signed in
Sign in
Sign up

442	--	457	Mostafa A. Bassiouni, U. Khamare. Algorithms for Reducing Rollbacks in Concurrency Control by Certification
458	--	473	B. Joe, R. B. Simpson. Corrections to Lee s Visibility Polygon Algorithm
474	--	479	Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack. Algorithms for Minimum Length Partitions of Polygons
480	--	500	Rami G. Melhem. Verification of a Class of Self-Timed Computational Networks

290	--	305	Ferenc Belik. Deadlock Avoidance with a Modified Banker s Algorithm
306	--	314	Chin-Chen Chang, C. Y. Chen. Performance of Two-Disk Partition Data Allocations
315	--	323	A. Hasham, Jörg-Rüdiger Sack. Bounds for Min-Max Heaps
324	--	329	J. Ian Munro, Patricio V. Poblete. Searchability in Merging and Implicit Data Structures
330	--	339	Erkki Mäkinen. On Top-Down Splaying
340	--	348	M. T. Noga. Sorting in Parallel by Double Distributive Partitioning

134	--	140	H. A. Burgdorff, Sushil Jajodia, Frederick N. Springsteel, Yechezkel Zalcstein. Alternative Methods for the Reconstruction of Trees from Their Traversals
141	--	147	Gen-Huey Chen, Maw-Sheng Chern, Richard C. T. Lee. A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems
148	--	156	Donald K. Friesen, Michael A. Langston. Bin Packing: On Optimizing the Number of Pieces Packed
157	--	162	George Loizou, Peter Thanisch. On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition
163	--	169	Erkki Mäkinen. Left Distance Binary Tree Representations
170	--	180	Shaunak Pawagi. Maximum Weight Independent Set in Trees

2	--	17	Svante Carlsson. Average-Case Results on Heapsort
18	--	24	Rade Doroslovacki, Ivan Stojmenovic, Ratko Tosic. Generating and Counting Triangular Systems
25	--	43	Jan van Leeuwen, Jirí Wiedermann. Array Processing Machines: An Abstract Model
44	--	48	Lutz Michael Wegner. A Generalized, One-Way, Stackless Quicksort

runs on WebDSL