Search results for "I-Bit"

Hits ?▲	Authors	Title	Venue	Year	Link
19	Oliver Günther 0001, Eugene Wong 0001	A Dual Approach to Detect Polyhedral Intersections in Arbitrary Demensions.	BIT	1991	DBLP DOI BibTeX RDF
19	M. D. Atkinson	The Recursive Structure of Some Ordering Problems.	BIT	1991	DBLP DOI BibTeX RDF
19	Vijay K. Vaishnavi, Timothy D. Korson	Height-Analysis of k-Dimensional Leaf and Node Height-Balanced Trees: A New Approach.	BIT	1991	DBLP DOI BibTeX RDF
19	Per Grape	Complete Problems with L-Samplable Distributions.	BIT	1991	DBLP DOI BibTeX RDF
19	C. Y. Chen, H. F. Lin	Optimality Criteria of the Disk Modulo Allocation Method for Cartesian Product Files.	BIT	1991	DBLP DOI BibTeX RDF
19	Weixiong Zhang, Nageswara S. V. Rao	Optimal Parallel Quicksort on Erew Pram.	BIT	1991	DBLP DOI BibTeX RDF
19	Shyan-Ming Yuan	An Efficient Fault-Tolerant Decentralized Commit Protocol for Single Site Failure.	BIT	1991	DBLP DOI BibTeX RDF
19	Jaana Eloranta	Minimizing the Number of Transitions with Respect to Observation Equivalence.	BIT	1991	DBLP DOI BibTeX RDF
19	Cao An Wang	Finding Minimal Nested Polygons.	BIT	1991	DBLP DOI BibTeX RDF
19	Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson	A Sublogarithmic Convex Hull Algorithm.	BIT	1990	DBLP DOI BibTeX RDF
19	Chiuyuan Chen, Ruei-Chuan Chang	On the Minimality of Polygon Triangualtion.	BIT	1990	DBLP DOI BibTeX RDF
19	Yannis Manolopoulos, John G. Kollias	Optimal Data Placement in Two-Headed Disk Systems.	BIT	1990	DBLP DOI BibTeX RDF
19	Sushil Jajodia, Frederick N. Springsteel	Lossless Outer Joins with Incomplete Information.	BIT	1990	DBLP DOI BibTeX RDF
19	Craig C. Douglas, Willard L. Miranker	The Multilevel Principle Applied to Sorting.	BIT	1990	DBLP DOI BibTeX RDF
19	Zbigniew Kokosinski	On Generation of Permutations Through Decomposition of Symmetric Groups Into Cosets.	BIT	1990	DBLP DOI BibTeX RDF
19	Sheau-Dong Lang	Analysis of Recursive Batched Interpolation Search.	BIT	1990	DBLP DOI BibTeX RDF
19	Jorma Tarhio	Uncle-Atrributed Grammars.	BIT	1990	DBLP DOI BibTeX RDF
19	Kotagiri Ramamohanarao, John Shepherd 0001, Ron Sacks-Davis	Multi-Attribute Hashing with Multiple File Copies for High Performance Partial-Match Retrieval.	BIT	1990	DBLP DOI BibTeX RDF
19	Arch Douglas Robison	An Improved Rewriting-Number Algorithm.	BIT	1990	DBLP DOI BibTeX RDF
19	Renzo Sprugnoli	Counting Labels in Binary Trees.	BIT	1990	DBLP DOI BibTeX RDF
19	Mark H. Overmars, Haijo Schipper, Micha Sharir	Storing Line Segments in Partition Trees.	BIT	1990	DBLP DOI BibTeX RDF
19	Yannis Manolopoulos, Christos Faloutsos	Analysis for the End of Block Wasted Space.	BIT	1990	DBLP DOI BibTeX RDF
19	R. T. Kuo, S. S. Tseng	On the Invariance of Male Optimal Stable Matching.	BIT	1990	DBLP DOI BibTeX RDF
19	Alan Stewart	An Axiomatic Treatment of SIMD Assignment.	BIT	1990	DBLP DOI BibTeX RDF
19	Heikki Mannila, Esko Ukkonen	Unifications, Deunifications, and Their Complexity.	BIT	1990	DBLP DOI BibTeX RDF
19	Jimmy J. M. Tan	A Maximum Stable Matching for the Roommates Problem.	BIT	1990	DBLP DOI BibTeX RDF
19	Chin-Chen Chang 0001, Chu-Hsing Lin	A Reciprocal Confluence Tree Unit and Its Applications.	BIT	1990	DBLP DOI BibTeX RDF
19	Vincent G. Winters	Minimal Perfect Hashing in Polynomial Time.	BIT	1990	DBLP DOI BibTeX RDF
19	Ravi Varadarajan	Partitioning Multi-Edge Graphs.	BIT	1990	DBLP DOI BibTeX RDF
19	Ivan Stojmenovic	An Optimal Algorithm for Generating Equivalence Relations on a Linear Array of Processors.	BIT	1990	DBLP DOI BibTeX RDF
19	Maciej M. Syslo, Pawel Winter	In-Trees and Plane Embeddings of Outerplanar Graphs.	BIT	1990	DBLP DOI BibTeX RDF
19	Shou-Hsuan Stephen Huang, Venkatraman Viswanathan	On the Construction of Weighted Time-Optimal B-Trees.	BIT	1990	DBLP DOI BibTeX RDF
19	Mohammad Zubair, S. N. Gupta	Embeddings on a Boolean Cube.	BIT	1990	DBLP DOI BibTeX RDF
19	Nen-Fu Huang	A Divide-and-Conquer Algorithm for Constructing Relative Neighborhood Graph.	BIT	1990	DBLP DOI BibTeX RDF
19	Nils Andersen	A General Transposition Method for a Matrix on Auxiliary Store.	BIT	1990	DBLP DOI BibTeX RDF
19	Bruce L. Bauslaugh, Frank Ruskey	Generating Alternating Permutations Lexicographically.	BIT	1990	DBLP DOI BibTeX RDF
19	J. Ian Munro, Venkatesh Raman 0001, Jeffrey S. Salowe	Stable in Situ Sorting and Minimum Data Movement.	BIT	1990	DBLP DOI BibTeX RDF
19	Eugene Veklerov	On the Decomposability of the Stable Marriage Problem.	BIT	1989	DBLP DOI BibTeX RDF
19	Ernst S. Selmer	On Shellsort and the Frobenius Problem.	BIT	1989	DBLP DOI BibTeX RDF
19	Nen-Fu Huang, Tsing-Her Huang	On the Complexity of Some Arborescences Finding Problems on a Multihop Radio Network.	BIT	1989	DBLP DOI BibTeX RDF
19	Peter Scheuermann, Young Chul Park, Edward Omiecinski	A Heuristic File Reorganization Algorithm Based on Record Clustering.	BIT	1989	DBLP DOI BibTeX RDF
19	Chau-Jy Lin, Jong-Chuang Tsay	A Systolic Generation of Combinations.	BIT	1989	DBLP DOI BibTeX RDF
19	Rami G. Melhem, Concettina Guerra	The Application of a Sequence Notation to the Design of Systolic Computations.	BIT	1989	DBLP DOI BibTeX RDF
19	Thomas Strothotte, Patrik Eriksson, Sören Vallner	A Note on Constructing Min-Max Heaps.	BIT	1989	DBLP DOI BibTeX RDF
19	S. S. Tseng	The Average Performance of a Parallel Stable Marriage Algorithm.	BIT	1989	DBLP DOI BibTeX RDF
19	William Gropp, Ilse C. F. Ipsen	Recursive Mesh Refinement on Hypercubes.	BIT	1989	DBLP DOI BibTeX RDF
19	Michael J. Quinn	Analysis and Benchmarking of Two Parallel Sorting Algorithms: Hyperquicksort and Quickmerge.	BIT	1989	DBLP DOI BibTeX RDF
19	Ricardo A. Baeza-Yates	A Trivial Algorithm Whose Analysis is Not: A Continuation.	BIT	1989	DBLP DOI BibTeX RDF
19	Marco Gori, Giovanni Soda	An Algebraic Approach to Cichelli's Perfect Hashing.	BIT	1989	DBLP DOI BibTeX RDF
19	Matti O. Jokinen	Automatically Replacing Indices Into Parallel Arrays with Pointers to Records.	BIT	1989	DBLP DOI BibTeX RDF
19	P. Gupta, G. P. Bhattacharjee	A Parallel Derangement Generation Algorithm.	BIT	1989	DBLP DOI BibTeX RDF
19	Per Galle	Branch & Sample: A Simple Strategy for Constraint Satisfaction.	BIT	1989	DBLP DOI BibTeX RDF
19	Shing-Tsaan Huang, Ming-Shin Tsai	A Linear Systolic Algorithm for the Connected Component Problem.	BIT	1989	DBLP DOI BibTeX RDF
19	Jens Clausen, Jakob Krarup	Arranging Apples in an Array.	BIT	1988	DBLP DOI BibTeX RDF
19	P. P. Nicolaou, C. C. Lefas	On the Recovery of Error Patterns from Signatures Obtained in Digital System Testing.	BIT	1988	DBLP DOI BibTeX RDF
19	Paul Erdös, Hans Riesel	On Admissible Constellations of Consecutive Primes.	BIT	1988	DBLP DOI BibTeX RDF
19	Keith W. Smillie	Array Theory and the Nial Programming Language.	BIT	1988	DBLP DOI BibTeX RDF
19	Edsger W. Dijkstra	On Binary Operators and Their Derived Relations.	BIT	1988	DBLP DOI BibTeX RDF
19	J. W. de Bakker, John-Jules Ch. Meyer	Metric Semantics for Concurrency.	BIT	1988	DBLP DOI BibTeX RDF
19	Chin-Chen Chang 0001	Application of Principal Component Analysis to Multi-Disk Concurrent Accessing.	BIT	1988	DBLP DOI BibTeX RDF
19	Franz Aurenhammer	On-Line Sorting of Twisted Sequences in Linear Time.	BIT	1988	DBLP DOI BibTeX RDF
19	Yannis Manolopoulos, John G. Kollias	Estimating Disk Head Movement in Batched Searching.	BIT	1988	DBLP DOI BibTeX RDF
19	Rolf G. Karlsson	Greedy Matching on a Grid.	BIT	1988	DBLP DOI BibTeX RDF
19	Jørgen Staunstrup, Mark R. Greenstreet	From High-Level Descriptions to VLSI Circuits.	BIT	1988	DBLP DOI BibTeX RDF
19	Brian H. Mayoh	On Formalisms.	BIT	1988	DBLP DOI BibTeX RDF
19	István Beck, Stein Krogdahl	A Select and Insert Sorting Algorithm.	BIT	1988	DBLP DOI BibTeX RDF
19	J. K. Gibson	A Generalisation of Brickell's Algorithm for Fast Modular Multiplication.	BIT	1988	DBLP DOI BibTeX RDF
19	Dana S. Richards, Pravin M. Vaidya	On the Distribution of Comparisons in Sorting Algorithms.	BIT	1988	DBLP DOI BibTeX RDF
19	Nageswara S. V. Rao, Vijay K. Vaishnavi, S. Sitharama Iyengar	On the Dynamization of Data Structures.	BIT	1988	DBLP DOI BibTeX RDF
19	Ivan Stojmenovic, Michael A. Langston	On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm.	BIT	1988	DBLP DOI BibTeX RDF
19	Carl-Erik Fröberg	On a Combinatorial Problem Related to Permanents.	BIT	1988	DBLP DOI BibTeX RDF
19	David Gries, Jinyun Xue	Generating a Random Cycle Permutation.	BIT	1988	DBLP DOI BibTeX RDF
19	Rolf G. Karlsson, Mark H. Overmars	Scanline Algorithms on a Grid.	BIT	1988	DBLP DOI BibTeX RDF
19	Bengt Nordström	Terminating General Recursion.	BIT	1988	DBLP DOI BibTeX RDF
19	Alan Stewart	SIMD Language Design Using Prescriptive Semantics.	BIT	1988	DBLP DOI BibTeX RDF
19	Anders P. Ravn, Hans Rischel, Hans Henrik Løvengreen	A Design Method for Embedded Software Systems.	BIT	1988	DBLP DOI BibTeX RDF
19	Annika Aasa, Sören Holmström, Christina Nilsson	An Efficiency Comparison of Some Representations of Purely Functional Arrays.	BIT	1988	DBLP DOI BibTeX RDF
19	Ling-Ling Wang, Wen-Hsiang Tsai	Optimal Assignment of Task Modules with Precedence for Distributed Processing by Graph Matching and State-Space Search.	BIT	1988	DBLP DOI BibTeX RDF
19	Andrei P. Ershov	Basic Concepts of Algorithms and Programming to be Taught in a School Course in Informatics.	BIT	1988	DBLP DOI BibTeX RDF
19	Christos Faloutsos	Signature Files: An Integrated Access Method for Text and Attributes, Sluitable for Optical Disk Storage.	BIT	1988	DBLP DOI BibTeX RDF
19	Shou-Hsuan Stephen Huang	A VLSI Partition Algorithm.	BIT	1988	DBLP DOI BibTeX RDF
19	Reino Kurki-Suonio, T. Kankaanpää	On the Design of Reactive Systems.	BIT	1988	DBLP DOI BibTeX RDF
19	Edward K. Blum	The Semantics and Complexity of Parallel Programs for Vector Computations. Part I: A Case Study Using Ada.	BIT	1988	DBLP DOI BibTeX RDF
19	Pranay Chaudhuri	Fast Parallel Graph Searching with Applications.	BIT	1988	DBLP DOI BibTeX RDF
19	Peter Johansen	Inductive Inference of Ultimately Periodic Sequences.	BIT	1988	DBLP DOI BibTeX RDF
19	Bo Einarsson	Tutorial on Analytical Methods as a Complement ot Numerical Computing.	BIT	1988	DBLP DOI BibTeX RDF
19	Steven Skiena	Encroaching Lists as a Measure of Presortedness.	BIT	1988	DBLP DOI BibTeX RDF
19	Wladyslaw M. Turski	Time Considered Irrelevant for Real-Time Systems.	BIT	1988	DBLP DOI BibTeX RDF
19	Edda Sveinsdottir, Erik Frøkjær	Datalogy - The Copenhagen Tradition of Computer Science.	BIT	1988	DBLP DOI BibTeX RDF
19	Shaunak Pawagi	Maximum Weight Independent Set in Trees.	BIT	1987	DBLP DOI BibTeX RDF
19	Erkki Mäkinen	On Top-Down Splaying.	BIT	1987	DBLP DOI BibTeX RDF
19	Donald K. Friesen, Michael A. Langston	Bin Packing: On Optimizing the Number of Pieces Packed.	BIT	1987	DBLP DOI BibTeX RDF
19	A. Hasham, Jörg-Rüdiger Sack	Bounds for Min-Max Heaps.	BIT	1987	DBLP DOI BibTeX RDF
19	Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack	Algorithms for Minimum Length Partitions of Polygons.	BIT	1987	DBLP DOI BibTeX RDF
19	Lutz M. Wegner	A Generalized, One-Way, Stackless Quicksort.	BIT	1987	DBLP DOI BibTeX RDF
19	Erkki Mäkinen	Left Distance Binary Tree Representations.	BIT	1987	DBLP DOI BibTeX RDF
19	Ferenc Belik	Deadlock Avoidance with a Modified Banker's Algorithm.	BIT	1987	DBLP DOI BibTeX RDF
19	Chin-Chen Chang 0001, C. Y. Chen	Performance of Two-Disk Partition Data Allocations.	BIT	1987	DBLP DOI BibTeX RDF
19	Barry Joe, R. B. Simpson	Corrections to Lee's Visibility Polygon Algorithm.	BIT	1987	DBLP DOI BibTeX RDF
19	H. A. Burgdorff, Sushil Jajodia, Frederick N. Springsteel, Yechezkel Zalcstein	Alternative Methods for the Reconstruction of Trees from Their Traversals.	BIT	1987	DBLP DOI BibTeX RDF