| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Cao An Wang |
Efficiently Updating Constrained Delaunay Triangulations.  |
BIT  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Evan P. Harris, Kotagiri Ramamohanarao |
Optimal Dynamic Multi-Attribute Hashing for Range Queries. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, Imrich Vrto |
On Crossing Numbers of Hypercubes and Cube Connected Cycles. |
BIT |
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. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jong-Jeng Chen, Chiau-Shin Wang, Ching-Roung Chou |
A General Performance Analysis Method for Uniform Memory Architectures. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Murali Thiyagarajah |
The Permutational Power of a Priority Queue. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Chang-Wu Yu 0001, Gen-Huey Chen |
Parallel Algorithms for Permutation Graphs. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Chin-Chen Chang 0001, Huey-Cheue Kowng, Tzong-Chen Wu |
A Refinement of a Compression-Oriented Addressing Scheme. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Olsson 0001 |
Execution of Logic Programs by Iterative Deepening A* SLD-Tree Search. |
BIT |
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. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Lundberg |
Performance Bounds on Multiprocessor Scheduling Strategies for Statically Allocated Programs. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Gerhard J. Woeginger |
The Complexity of Detecting Crossingfree Configurations in the Plane. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong Chich Chou, Chung-Ping Chung |
Modeling of Superscalar Instruction Scheduling and Analysis of a Heuristic Scheduling Algorithm. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Chiou-Kuo Liang |
An O(n2) Algorithm for Finding the Compact Sets of a Graph. |
BIT |
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. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Celina Imielinska, Bahman Kalantari |
A Generalized Hypergreedy Algorithm for Weighted Perfect Matching. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricio V. Poblete |
A Note on the Height of The kthe Element in a Heap. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Shing Yu, Cheng-Hsing Yang |
A Linear Time Algorithm for the Maximum Matching Problem on Cographs. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald D. Dutton |
Weak-Heap Sort. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Olav Lysne |
The Equational Part of Proofs by Structural Induction. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Olariu, James L. Schwing, Jingyuan Zhang |
Optimal Convex Hull Algorithms on Enhanced Meshes. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. |
BIT |
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. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesca Cesarini, Giovanni Soda |
Single Access Hashing with Overflow Separators for Dynamic Files. |
BIT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Thierry Coquand |
The Paradox of Trees in Type Theory. |
BIT |
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. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Salvesen |
On Specifications, Subset Types and Interpretation of Proposition in Type Theory. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Mamoru Hoshi, Philippe Flajolet |
Page Usage in a Quadtree Index. |
BIT |
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. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeannette M. de Graaf, Walter A. Kosters |
Expected Heights in Heaps. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Fredholm, Svetozar Serafimovski |
Partial Inductive Definitions as Type-Systems for lambda-Terms. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Hallnäs |
On Systems of Definitions, Induction and Recursion. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Kris Coolsaet, Hans E. De Meyer, Veerle Fack |
Optimal Algorithms for Total Exchange without Buffering on the Hypercube. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravi B. Boppana, Magnús M. Halldórsson |
Approximating Maximum Independent Sets by Excluding Subgraphs. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Grigori Mints |
Complexity of Subclasses of the Intuitionistic Propositional Calculus. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann Blieberger, Ulrich Schmid 0001 |
FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Olariu, James L. Schwing, Jingyuan Zhang |
A Constant-Time Channel-Assignment Algorithm on Reconfigurable Meshes. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | John Hershberger 0001, Subhash Suri |
Applications of a Semi-Dynamic Convex Hull Algorithm. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jyrki Katajainen, Tomi Pasanen |
Stable Minimum Space Partitioning in Linear Time. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Levene, George Loizou |
Inferring Null Join Dependencies in Relational Databases. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas |
Fast Algorithms for Greedy Triangulation. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Chang-Wu Yu 0001, Gen-Huey Chen |
The Weighted Maximum Independent Set Problem in Permutation Graphs. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Louise Perkins |
A Mixed Directed-Undirected Data Structure for a Parallel Implementation of a Domain Decomposition Algorithm. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik Palmgren, Viggo Stoltenberg-Hansen |
Remarks on Martin-Löf's Partial Type Theory. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry G. Mairson |
The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Finding the k Smallest Spanning Trees. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Andrzej Proskurowski |
Canonical Representations of Partial 2- and 3-Trees. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Joëlle Despeyroux |
Theo: An Interactive Proof Development System. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Loïc Colson |
On List Primitive Recursion and the Complexity of Computing inf. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani |
Improved Bounds for the Expected Behaviour of AVL Trees. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal |
Intersection Queries in Sets of Disks. |
BIT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Papadakis, J. Ian Munro, Patricio V. Poblete |
Average Search and Update Costs in Skip Lists. |
BIT |
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. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | H. Van de Vel, Sun Shijie |
A Modification of Hochbaum and Shmoys' Algorithm for Scheduling Problems. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc J. van Kreveld, Mark de Berg |
Finding Squares and Rectangles in Sets of Points. |
BIT |
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. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher |
Efficient Reduction for Path Problems on Circular-Arc Graphs. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Lung-Tien Liu, Gen-Huey Chen, Yue-Li Wang |
A Note on Optimal Multiway Split Trees. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo |
The Set Union Problem with Dynamic Weighted Backtracking. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Ben Johnsen |
Generating Binary Trees with Uniform Probability. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | John Konvalina, Yi-Hsin Liu |
Bit Strings Without q-Separation. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas |
An Unfeasible Matching Problem. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Haijo Schipper, Mark H. Overmars |
Dynamic Partition Trees. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Juha Puustjärvi |
Distributed Management of Transactions in Heterogeneous Distributed Database Systems. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Günther 0001, Eugene Wong 0001 |
A Dual Approach to Detect Polyhedral Intersections in Arbitrary Demensions. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
The Recursive Structure of Some Ordering Problems. |
BIT |
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. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Grape |
Complete Problems with L-Samplable Distributions. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Y. Chen, H. F. Lin |
Optimality Criteria of the Disk Modulo Allocation Method for Cartesian Product Files. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Weixiong Zhang, Nageswara S. V. Rao |
Optimal Parallel Quicksort on Erew Pram. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Shyan-Ming Yuan |
An Efficient Fault-Tolerant Decentralized Commit Protocol for Single Site Failure. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaana Eloranta |
Minimizing the Number of Transitions with Respect to Observation Equivalence. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Cao An Wang |
Finding Minimal Nested Polygons. |
BIT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson |
A Sublogarithmic Convex Hull Algorithm. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Chiuyuan Chen, Ruei-Chuan Chang |
On the Minimality of Polygon Triangualtion. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Yannis Manolopoulos, John G. Kollias |
Optimal Data Placement in Two-Headed Disk Systems. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushil Jajodia, Frederick N. Springsteel |
Lossless Outer Joins with Incomplete Information. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Craig C. Douglas, Willard L. Miranker |
The Multilevel Principle Applied to Sorting. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Zbigniew Kokosinski |
On Generation of Permutations Through Decomposition of Symmetric Groups Into Cosets. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheau-Dong Lang |
Analysis of Recursive Batched Interpolation Search. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Jorma Tarhio |
Uncle-Atrributed Grammars. |
BIT |
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. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Arch Douglas Robison |
An Improved Rewriting-Number Algorithm. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Renzo Sprugnoli |
Counting Labels in Binary Trees. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark H. Overmars, Haijo Schipper, Micha Sharir |
Storing Line Segments in Partition Trees. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Yannis Manolopoulos, Christos Faloutsos |
Analysis for the End of Block Wasted Space. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | R. T. Kuo, S. S. Tseng |
On the Invariance of Male Optimal Stable Matching. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan Stewart |
An Axiomatic Treatment of SIMD Assignment. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Heikki Mannila, Esko Ukkonen |
Unifications, Deunifications, and Their Complexity. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Jimmy J. M. Tan |
A Maximum Stable Matching for the Roommates Problem. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Chin-Chen Chang 0001, Chu-Hsing Lin |
A Reciprocal Confluence Tree Unit and Its Applications. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent G. Winters |
Minimal Perfect Hashing in Polynomial Time. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravi Varadarajan |
Partitioning Multi-Edge Graphs. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Stojmenovic |
An Optimal Algorithm for Generating Equivalence Relations on a Linear Array of Processors. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej M. Syslo, Pawel Winter |
In-Trees and Plane Embeddings of Outerplanar Graphs. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Shou-Hsuan Stephen Huang, Venkatraman Viswanathan |
On the Construction of Weighted Time-Optimal B-Trees. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Zubair, S. N. Gupta |
Embeddings on a Boolean Cube. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Nen-Fu Huang |
A Divide-and-Conquer Algorithm for Constructing Relative Neighborhood Graph. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Nils Andersen |
A General Transposition Method for a Matrix on Auxiliary Store. |
BIT |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license