Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Cao An Wang |
Efficiently Updating Constrained Delaunay Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(2), pp. 238-252, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Evan P. Harris, Kotagiri Ramamohanarao |
Optimal Dynamic Multi-Attribute Hashing for Range Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(4), pp. 561-579, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Ondrej Sýkora, Imrich Vrto |
On Crossing Numbers of Hypercubes and Cube Connected Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(2), pp. 232-237, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Jinn-Ke Jan, Chin-Chen Chang 0001 |
A Key-Lock-Pair Oriented Access Control Scheme for the Growth of Users and Files. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 382-389, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Jong-Jeng Chen, Chiau-Shin Wang, Ching-Roung Chou |
A General Performance Analysis Method for Uniform Memory Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(4), pp. 536-560, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | M. D. Atkinson, Murali Thiyagarajah |
The Permutational Power of a Priority Queue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(1), pp. 1-6, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Chang-Wu Yu 0001, Gen-Huey Chen |
Parallel Algorithms for Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 413-419, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Chin-Chen Chang 0001, Huey-Cheue Kowng, Tzong-Chen Wu |
A Refinement of a Compression-Oriented Addressing Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(4), pp. 529-535, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Roland Olsson 0001 |
Execution of Logic Programs by Iterative Deepening A* SLD-Tree Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(2), pp. 214-231, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Giorgio Gambosi, Marco Protasi, Maurizio Talamo |
An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(1), pp. 29-45, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Lars Lundberg |
Performance Bounds on Multiprocessor Scheduling Strategies for Statically Allocated Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(2), pp. 190-213, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Jansen, Gerhard J. Woeginger |
The Complexity of Detecting Crossingfree Configurations in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(4), pp. 580-595, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Hong Chich Chou, Chung-Ping Chung |
Modeling of Superscalar Instruction Scheduling and Analysis of a Heuristic Scheduling Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 354-371, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Chiou-Kuo Liang |
An O(n2) Algorithm for Finding the Compact Sets of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 390-395, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Horng-Twu Liaw, Chin-Laung Lei |
An Optimal Algorithm to Assign Cryptographic Keys in a Tree Structure for Access Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(1), pp. 46-56, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Celina Imielinska, Bahman Kalantari |
A Generalized Hypergreedy Algorithm for Weighted Perfect Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(2), pp. 177-189, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Patricio V. Poblete |
A Note on the Height of The kthe Element in a Heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 411-412, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Ming-Shing Yu, Cheng-Hsing Yang |
A Linear Time Algorithm for the Maximum Matching Problem on Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 420-432, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Ronald D. Dutton |
Weak-Heap Sort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 372-381, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Olav Lysne |
The Equational Part of Proofs by Structural Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(4), pp. 596-618, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Stephan Olariu, James L. Schwing, Jingyuan Zhang |
Optimal Convex Hull Algorithms on Enhanced Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 396-410, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Iain A. Stewart |
An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(1), pp. 57-62, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Dharmavani Bhagavathi, Peter J. Looges, Stephan Olariu, James L. Schwing, Jingyuan Zhang |
Selection on Rectangular Meshes with Multiple Broadcasting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(1), pp. 7-14, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Francesca Cesarini, Giovanni Soda |
Single Access Hashing with Overflow Separators for Dynamic Files. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(1), pp. 15-28, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Thierry Coquand |
The Paradox of Trees in Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(1), pp. 10-14, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Rong-Hong Jan, Lih-Hsing Hsu, Yueh-Ying Lee |
The Most Vital Edges with Respect to the Number of Spanning Trees in Two-Terminal Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(3), pp. 403-412, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Anne Salvesen |
On Specifications, Subset Types and Interpretation of Proposition in Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(1), pp. 84-101, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Mamoru Hoshi, Philippe Flajolet |
Page Usage in a Quadtree Index. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(3), pp. 384-402, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Tung-Shou Chen, Wei-Pang Yang, Richard C. T. Lee |
Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and N-Step SCAN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(4), pp. 546-558, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Jeannette M. de Graaf, Walter A. Kosters |
Expected Heights in Heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(4), pp. 570-579, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Fredholm, Svetozar Serafimovski |
Partial Inductive Definitions as Type-Systems for lambda-Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(1), pp. 30-44, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Lars Hallnäs |
On Systems of Definitions, Induction and Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(1), pp. 45-63, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Kris Coolsaet, Hans E. De Meyer, Veerle Fack |
Optimal Algorithms for Total Exchange without Buffering on the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(4), pp. 559-569, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Ravi B. Boppana, Magnús M. Halldórsson |
Approximating Maximum Independent Sets by Excluding Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 180-196, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Grigori Mints |
Complexity of Subclasses of the Intuitionistic Propositional Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(1), pp. 64-69, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Johann Blieberger, Ulrich Schmid 0001 |
FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(3), pp. 370-383, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Stephan Olariu, James L. Schwing, Jingyuan Zhang |
A Constant-Time Channel-Assignment Algorithm on Reconfigurable Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(4), pp. 586-597, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | John Hershberger 0001, Subhash Suri |
Applications of a Semi-Dynamic Convex Hull Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 249-267, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Jyrki Katajainen, Tomi Pasanen |
Stable Minimum Space Partitioning in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(4), pp. 580-585, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Mark Levene, George Loizou |
Inferring Null Join Dependencies in Relational Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(3), pp. 413-429, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 215-236, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Christos Levcopoulos, Andrzej Lingas |
Fast Algorithms for Greedy Triangulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 280-296, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Chang-Wu Yu 0001, Gen-Huey Chen |
The Weighted Maximum Independent Set Problem in Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(4), pp. 609-618, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | A. Louise Perkins |
A Mixed Directed-Undirected Data Structure for a Parallel Implementation of a Domain Decomposition Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(4), pp. 598-608, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Erik Palmgren, Viggo Stoltenberg-Hansen |
Remarks on Martin-Löf's Partial Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(1), pp. 70-83, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Harry G. Mairson |
The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(3), pp. 430-440, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | David Eppstein |
Finding the k Smallest Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 237-248, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Arnborg, Andrzej Proskurowski |
Canonical Representations of Partial 2- and 3-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 197-214, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Joëlle Despeyroux |
Theo: An Interactive Proof Development System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(1), pp. 15-29, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Loïc Colson |
On List Primitive Recursion and the Complexity of Computing inf. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(1), pp. 5-9, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani |
Improved Bounds for the Expected Behaviour of AVL Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 297-315, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal |
Intersection Queries in Sets of Disks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 268-279, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Papadakis, J. Ian Munro, Patricio V. Poblete |
Average Search and Update Costs in Skip Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 32(2), pp. 316-332, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
1 | Kim-Heng Teo, Tai-Ching Tuan |
A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(4), pp. 598-606, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | H. Van de Vel, Sun Shijie |
A Modification of Hochbaum and Shmoys' Algorithm for Scheduling Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(1), pp. 50-52, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Marc J. van Kreveld, Mark de Berg |
Finding Squares and Rectangles in Sets of Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(2), pp. 202-219, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Frank Bartling, Klaus H. Hinrichs |
Probabilistic Analysis of an Algorithm for Solving the k-Dimensional All-Nearest-Neighbors Problem by Projection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(4), pp. 558-565, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher |
Efficient Reduction for Path Problems on Circular-Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(2), pp. 181-193, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Lung-Tien Liu, Gen-Huey Chen, Yue-Li Wang |
A Note on Optimal Multiway Split Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(2), pp. 220-229, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo |
The Set Union Problem with Dynamic Weighted Backtracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(3), pp. 381-393, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Ben Johnsen |
Generating Binary Trees with Uniform Probability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(1), pp. 15-31, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | John Konvalina, Yi-Hsin Liu |
Bit Strings Without q-Separation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(1), pp. 32-35, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Andrzej Lingas |
An Unfeasible Matching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(4), pp. 591-597, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Haijo Schipper, Mark H. Overmars |
Dynamic Partition Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(3), pp. 421-436, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Juha Puustjärvi |
Distributed Management of Transactions in Heterogeneous Distributed Database Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(3), pp. 406-420, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Oliver Günther 0001, Eugene Wong 0001 |
A Dual Approach to Detect Polyhedral Intersections in Arbitrary Demensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(1), pp. 2-14, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | M. D. Atkinson |
The Recursive Structure of Some Ordering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(2), pp. 194-201, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Vijay K. Vaishnavi, Timothy D. Korson |
Height-Analysis of k-Dimensional Leaf and Node Height-Balanced Trees: A New Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(1), pp. 36-49, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Per Grape |
Complete Problems with L-Samplable Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(3), pp. 394-405, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | C. Y. Chen, H. F. Lin |
Optimality Criteria of the Disk Modulo Allocation Method for Cartesian Product Files. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(4), pp. 566-575, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Weixiong Zhang, Nageswara S. V. Rao |
Optimal Parallel Quicksort on Erew Pram. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(1), pp. 69-74, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Shyan-Ming Yuan |
An Efficient Fault-Tolerant Decentralized Commit Protocol for Single Site Failure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(1), pp. 53-68, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Jaana Eloranta |
Minimizing the Number of Transitions with Respect to Observation Equivalence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(4), pp. 576-590, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Cao An Wang |
Finding Minimal Nested Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(2), pp. 230-236, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
1 | Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson |
A Sublogarithmic Convex Hull Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(3), pp. 378-384, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Chiuyuan Chen, Ruei-Chuan Chang |
On the Minimality of Polygon Triangualtion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(4), pp. 570-582, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Yannis Manolopoulos, John G. Kollias |
Optimal Data Placement in Two-Headed Disk Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(2), pp. 216-219, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Sushil Jajodia, Frederick N. Springsteel |
Lossless Outer Joins with Incomplete Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(1), pp. 34-41, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Craig C. Douglas, Willard L. Miranker |
The Multilevel Principle Applied to Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(2), pp. 177-195, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Zbigniew Kokosinski |
On Generation of Permutations Through Decomposition of Symmetric Groups Into Cosets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(4), pp. 583-591, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Sheau-Dong Lang |
Analysis of Recursive Batched Interpolation Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(1), pp. 42-50, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Jorma Tarhio |
Uncle-Atrributed Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(3), pp. 437-449, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Kotagiri Ramamohanarao, John Shepherd 0001, Ron Sacks-Davis |
Multi-Attribute Hashing with Multiple File Copies for High Performance Partial-Match Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(3), pp. 404-423, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Arch Douglas Robison |
An Improved Rewriting-Number Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(1), pp. 51-61, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Renzo Sprugnoli |
Counting Labels in Binary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(1), pp. 62-69, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Mark H. Overmars, Haijo Schipper, Micha Sharir |
Storing Line Segments in Partition Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(3), pp. 385-403, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Yannis Manolopoulos, Christos Faloutsos |
Analysis for the End of Block Wasted Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(4), pp. 620-630, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | R. T. Kuo, S. S. Tseng |
On the Invariance of Male Optimal Stable Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(4), pp. 592-598, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Alan Stewart |
An Axiomatic Treatment of SIMD Assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(1), pp. 70-82, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Heikki Mannila, Esko Ukkonen |
Unifications, Deunifications, and Their Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(4), pp. 599-619, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Jimmy J. M. Tan |
A Maximum Stable Matching for the Roommates Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(4), pp. 631-640, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Chin-Chen Chang 0001, Chu-Hsing Lin |
A Reciprocal Confluence Tree Unit and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(1), pp. 27-33, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Vincent G. Winters |
Minimal Perfect Hashing in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(2), pp. 235-244, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Ravi Varadarajan |
Partitioning Multi-Edge Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(3), pp. 450-463, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Ivan Stojmenovic |
An Optimal Algorithm for Generating Equivalence Relations on a Linear Array of Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(3), pp. 424-436, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Maciej M. Syslo, Pawel Winter |
In-Trees and Plane Embeddings of Outerplanar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(1), pp. 83-90, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Shou-Hsuan Stephen Huang, Venkatraman Viswanathan |
On the Construction of Weighted Time-Optimal B-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(2), pp. 207-215, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Mohammad Zubair, S. N. Gupta |
Embeddings on a Boolean Cube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(2), pp. 245-256, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Nen-Fu Huang |
A Divide-and-Conquer Algorithm for Constructing Relative Neighborhood Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(2), pp. 196-206, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
1 | Nils Andersen |
A General Transposition Method for a Matrix on Auxiliary Store. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 30(1), pp. 2-16, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|