Chak-Kuen Wong

J. Comput. Civ. Eng., 2019

Designs for Safer Signal-Controlled Intersections by Statistical Analysis of Accident Data at Accident Blacksites.

[BibT_eX]

[DOI]

IEEE Access, 2019

2014

C1: an Automated Online Eduication Management System Based on an Object-Oriented Approach.

[BibT_eX]

[DOI]

J. Web Eng., 2014

2010

Analysis of a nonlinear oscillator with discontinuity.

[BibT_eX]

[DOI]

Deqiang Zeng

Yiu Yin Raymond Lee

Comput. Math. Appl., 2010

2008

Silicon oxynitride integrated waveguide for on-chip optical interconnects applications.

[BibT_eX]

[DOI]

Microelectron. Reliab., 2008

The influence of solder volume and pad area on Sn-3.8Ag-0.7Cu and Ni UBM reaction in reflow soldering and isothermal aging.

[BibT_eX]

[DOI]

Microelectron. Reliab., 2008

Trada: tree based ranking function adaptation.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007

Silicon integrated photonics begins to revolutionize.

[BibT_eX]

[DOI]

Microelectron. Reliab., 2007

2006

Minimizing hydrogen content in silicon oxynitride by thermal oxidation of silicon-rich silicon nitride.

[BibT_eX]

[DOI]

Microelectron. Reliab., 2006

An FPGA-Based Electronic Cochlea with Dual Fixed-Point Arithmetic.

[BibT_eX]

[DOI]

Philip Heng Wai Leong

Proceedings of the 2006 International Conference on Field Programmable Logic and Applications (FPL), 2006

2005

Immediate Data Authentication for Multicast in Resource Constrained Network.

[BibT_eX]

[DOI]

Agnes Chan

Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004

Approximation of Boolean Functions by Local Search.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2004

An FPGA-based Othello endgame solver.

[BibT_eX]

[DOI]

K. K. Lo

Philip Heng Wai Leong

Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology, 2004

2003

Analysis of FPGA/FPIC switch modules.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 2003

A Lane-Based Optimization Method for Minimizing Delay at Isolated Signal-Controlled Junctions.

[BibT_eX]

[DOI]

Sze Chun Wong

J. Math. Model. Algorithms, 2003

Wafer Bonding Process Based On The Taguchi Analysis.

[BibT_eX]

[DOI]

Int. J. Comput. Eng. Sci., 2003

A Novel Wafer-Level Packaging Solution For Mems.

[BibT_eX]

[DOI]

Int. J. Comput. Eng. Sci., 2003

A Polymer-Based Optical Switch Fabricated Using Silicon Process, Electroplating And Micro Hot Embossing.

[BibT_eX]

[DOI]

Int. J. Comput. Eng. Sci., 2003

An experimental analysis of local minima to improve neighbourhood search.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2003

Common gateway interfacing and dynamic jpeg techniques for remote handheld.

[BibT_eX]

Carrison K. S. Tong

Kwok Kwan Chan

Proceedings of the CARS 2003. Computer Assisted Radiology and Surgery. Proceedings of the 17th International Congress and Exhibition, 2003

2002

Reduction design for generic universal switch blocks.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 2002

The convergence of stochastic algorithms solving flow shop scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

An automata network for performing combinatorial optimization.

[BibT_eX]

[DOI]

Neurocomputing, 2002

An effective quasi-human based heuristic for solving the rectangle packing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

Fast parallel heuristics for the job shop scheduling problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2002

Bounded-depth threshold circuits for computer-assisted CT image classification.

[BibT_eX]

[DOI]

Artif. Intell. Medicine, 2002

A Simulated Annealing and Resampling Method for Training Perceptrons to Classify Gene-Expression Data.

[BibT_eX]

[DOI]

Staal Amund Vinterbo

Lucila Ohno-Machado

Proceedings of the Artificial Neural Networks, 2002

2001

A new model of simulated evolutionary computation-convergence analysis and specifications.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2001

A parallelized genetic algorithm for the calibration of Lowry model.

[BibT_eX]

[DOI]

Sze Chun Wong

C. O. Tong

Parallel Comput., 2001

Combining the Perceptron Algorithm with Logarithmic Simulated Annealing.

[BibT_eX]

[DOI]

Neural Process. Lett., 2001

On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks.

[BibT_eX]

[DOI]

Hongbing Fan

Graphs Comb., 2001

Time-varying minimum cost flow problems.

[BibT_eX]

[DOI]

Xiaoqiang Cai

Dan Sha

Eur. J. Oper. Res., 2001

Steiner Trees in General Nonuniform Orientations.

[BibT_eX]

[DOI]

Y. Y. Li

Computing, 2001

The Kr-Packing Problem.

[BibT_eX]

[DOI]

Computing, 2001

On the Convergence of Inhomogeneous Markov Chains Approximating Equilibrium Placements of Flexible Objects.

[BibT_eX]

[DOI]

S. K. Cheung

Comput. Optim. Appl., 2001

Logarithmic simulated annealing for X-ray diagnosis.

[BibT_eX]

[DOI]

Matthias Taupitz

Artif. Intell. Medicine, 2001

On the Signal Bounding Problem in Timing Analysis.

[BibT_eX]

[DOI]

Proceedings of the 2001 IEEE/ACM International Conference on Computer-Aided Design, 2001

A local search method for pattern classification.

[BibT_eX]

[DOI]

Proceedings of the 9th European Symposium on Artificial Neural Networks, 2001

Liver tissue classification by bounded-depth threshold circuits.

[BibT_eX]

Proceedings of the CARS 2001. Computer Assisted Radiology and Surgery. Proceedings of the 15th International Congress and Exhibition, 2001

Depth-Four Threshold Circuits for Computer-Assisted X-ray Diagnosis.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Medicine, 2001

2000

Simulated annealing-based algorithms for the studies of the thermoelastic scaling behavior.

[BibT_eX]

[DOI]

Y. C. Wong

IEEE Trans. Syst. Man Cybern. Part C, 2000

OBDD Minimization Based on Two-Level Representation of Boolean Functions.

[BibT_eX]

[DOI]

Malgorzata Marek-Sadowska

Hongbing Fan

IEEE Trans. Computers, 2000

Linear time-approximation algorithms for bin packing.

[BibT_eX]

[DOI]

Guochuan Zhang

Xiaoqiang Cai

Oper. Res. Lett., 2000

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems.

[BibT_eX]

[DOI]

Y. Y. Li

J. Comb. Optim., 2000

Decomposition of Graphs into (g, f)-Factors.

[BibT_eX]

[DOI]

Graphs Comb., 2000

Rooted Spanning Trees in Tournaments.

[BibT_eX]

[DOI]

Graphs Comb., 2000

Self-complementary graphs and Ramsey numbers Part I: the decomposition and construction of self-complementary graphs.

[BibT_eX]

[DOI]

Jin Xu

Discret. Math., 2000

On the bounded domination number of tournaments.

[BibT_eX]

[DOI]

Xiaoyun Lu

Da-Wei Wang

Discret. Math., 2000

Distributed Simulated Annealing for Job Shop Scheduling.

[BibT_eX]

[DOI]

Uwe Der

Proceedings of the Parallel Problem Solving from Nature, 2000

On Logarithmic Simulated Annealing.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

Inhomogeneous Markov Chains Applied to Pattern Classification.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

1999

On k-ary spanning trees of tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Two simulated annealing-based heuristics for the job shop scheduling problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

The strong Hall property and symmetric chain orders.

[BibT_eX]

[DOI]

Xiaoyun Lu

Da-Wei Wang

Discret. Math., 1999

Foreword.

[BibT_eX]

[DOI]

Jin-yi Cai

Algorithmica, 1999

A Cogitative Algorithm for Solving the Equal Circles Packing Problem.

[BibT_eX]

[DOI]

Wenqi Huang

Proceedings of the Handbook of Combinatorial Optimization, 1999

1998

Floating Steiner Trees.

[BibT_eX]

[DOI]

Wei-Liang Lin

IEEE Trans. Computers, 1998

Minimum Fill-in on Circle and Circular-Arc Graphs.

[BibT_eX]

[DOI]

Dieter Kratsch

J. Algorithms, 1998

Vertex Ranking of Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

Haiko Müller

Inf. Process. Lett., 1998

On the optimal four-way switch box routing structures of FPGA greedy routing architectures1.

[BibT_eX]

[DOI]

Integr., 1998

On avoidable and unavoidable claws.

[BibT_eX]

[DOI]

Xiaoyun Lu

Da-Wei Wang

Discret. Math., 1998

The Vertex-Disjoint Triangles Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Optimal Placements of Flexible Objects: An Adaptive Simulated Annealing Approach.

[BibT_eX]

[DOI]

S. K. Cheung

Proceedings of the Parallel Problem Solving from Nature, 1998

On thin Boolean functions and related optimum OBDD ordering.

[BibT_eX]

[DOI]

Hongbing Fan

Proceedings of the International Conference on Computer Design: VLSI in Computers and Processors, 1998

On the Optimal Sub-routing Structures of 2-D FPGA Greedy Routing Architectures.

[BibT_eX]

[DOI]

Jiaofeng Pan

Proceedings of the ASP-DAC '98, 1998

1997

Routing for symmetric FPGAs and FPICs.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1997

The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Time-varying shortest path problems with constraints.

[BibT_eX]

[DOI]

X. Cai

Networks, 1997

The Steiner Tree Problem in Orientation Metrics.

[BibT_eX]

[DOI]

G. Y. Yan

G. H. F. Young

J. Comput. Syst. Sci., 1997

Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

Total variation image restoration: numerical methods and extensions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

Optimal Placements of Flexible Objects: An Evolutionary Programming Approach.

[BibT_eX]

S. K. Cheung

Proceedings of the 7th International Conference on Genetic Algorithms, 1997

1996

Universal switch modules for FPGA design.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 1996

A timing analysis algorithm for circuits with level-sensitive latches.

[BibT_eX]

[DOI]

Jin-Fuw Lee

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

Rectilinear Paths Among Rectilinear Obstacles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Shortest Path Problems with Time Constraints.

[BibT_eX]

[DOI]

X. Cai

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Universal Switch-Module Design for Symmetric-Array-Based FPGAs.

[BibT_eX]

[DOI]

Proceedings of the 1996 Fourth International Symposium on Field Programmable Gate Arrays, 1996

1995

Optimal net assignment.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995

Rectilinear Path Problems among Rectilinear Obstacles Revisited.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

Design and analysis of FPGA/FPIC switch modules.

[BibT_eX]

[DOI]

Proceedings of the 1995 International Conference on Computer Design (ICCD '95), 1995

FPGA global routing based on a new congestion metric.

[BibT_eX]

[DOI]

Proceedings of the 1995 International Conference on Computer Design (ICCD '95), 1995

1994

Single-layer global routing.

[BibT_eX]

[DOI]

Kuo-Feng Liao

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

A weighted Steiner tree-based global router with simultaneous length and density minimization.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1994

Process-variation-tolerant clock skew minimization.

[BibT_eX]

[DOI]

Shen Lin

Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, 1994

The reproducing placement problem with applications.

[BibT_eX]

[DOI]

Wei-Liang Lin

Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, 1994

1993

Determining the Shorest Process Migration Paths for Program Compilation Using a Dynamic Programming Approach.

[BibT_eX]

[DOI]

ACM SIGOPS Oper. Syst. Rev., 1993

On over-the-cell channel routing.

[BibT_eX]

[DOI]

Proceedings of the European Design Automation Conference 1993, 1993

1992

Hierarchical Steiner tree construction in uniform orientations.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1992

A performance-aimed cell compactor with automatic jogs.

[BibT_eX]

[DOI]

Jin-Fuw Lee

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1992

Provably good performance-driven global routing.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1992

Bottleneck Steiner Trees in the Plane.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

On bends and lengths of rectilinear paths: a graph theoretic approach.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1992

1991

Incremental time-slot assignment in SS/TDMA satellite systems.

[BibT_eX]

[DOI]

Maurizio A. Bonuccelli

IEEE Trans. Commun., 1991

Minimum Diameter Spanning Trees and Related Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

Planar topological routing of pad nets.

[BibT_eX]

[DOI]

Integr., 1991

An optimal algorithm for rectilinear steiner trees for channels with obstacles.

[BibT_eX]

[DOI]

Int. J. Circuit Theory Appl., 1991

Performance-Driven Global Routing for Cell Based ICs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1991 IEEE International Conference on Computer Design: VLSI in Computer & Processors, 1991

1990

New algorithms for the rectilinear Steiner tree problem.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

Layer assignment for multichip modules.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

Pad minimization for planar routing of multiple power nets.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

Global routing based on Steiner min-max trees.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

1989

On VHV-routing in channels with irregular boundaries.

[BibT_eX]

[DOI]

Hai Hsia Chen

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989

Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree.

[BibT_eX]

[DOI]

Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989

A powerful global router: based on Steiner min-max trees.

[BibT_eX]

[DOI]

Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989

A New Approach to the Rectilinear Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM/IEEE Design Automation Conference, 1989

1988

Maximizing pin alignment in semi-custom chip circuit layout.

[BibT_eX]

[DOI]

Lin S. Woo

Integr., 1988

1987

A Hierarchical Global Wiring Algorithm for Custom Chip Design.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987

Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1987

Minimum-Area Wiring for Slicing Structures.

[BibT_eX]

[DOI]

Wing K. Luk

Paolo Sipala

IEEE Trans. Computers, 1987

On Some Distance Problems in Fixed Orientations.

[BibT_eX]

[DOI]

Ying-Fung Wu

SIAM J. Comput., 1987

A note on visibility graphs.

[BibT_eX]

[DOI]

S. Mazzone

Discret. Math., 1987

1986

Minimum k-hamiltonian graphs, II.

[BibT_eX]

[DOI]

Madeleine Paoli

W. W. Wong

J. Graph Theory, 1986

Faster Construction of Optimal Binary Split Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1986

On some union and intersection problems for polygons with fixed orientations.

[BibT_eX]

[DOI]

Computing, 1986

A Faster Approximation Algorithm for the Steiner Problem in Graphs.

[BibT_eX]

[DOI]

Ying-Fung Wu

Acta Informatica, 1986

Constructing Maximal Slicings from Geometry.

[BibT_eX]

[DOI]

Acta Informatica, 1986

Generating Binary Trees of Bounded Height.

[BibT_eX]

[DOI]

C. C. Lee

Acta Informatica, 1986

Hierarchial global wiring for custom chip design.

[BibT_eX]

[DOI]

Wing K. Luk

Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, 1986

1985

Minimizing the Number of Switchings in an SS/TDMA System.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1985

A Method for Improving Cascode-Switch Macro Wirability.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1985

An Optimal Algorithm for the Maximum Alignment of Terminals.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

Distance problems in computational geometry with fixed orientations.

[BibT_eX]

[DOI]

Ying-Fung Wu

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Minimum K-hamiltonian graphs.

[BibT_eX]

[DOI]

W. W. Wong

J. Graph Theory, 1984

Optimal Binary Split Trees.

[BibT_eX]

[DOI]

Shou-Hsuan Stephen Huang

J. Algorithms, 1984

Maximizing pin alignment by pin permutations.

[BibT_eX]

[DOI]

Martine D. F. Schlag

Lin S. Woo

Integr., 1984

Generalized Binary Split Trees.

[BibT_eX]

[DOI]

Shou-Hsuan Stephen Huang

Acta Informatica, 1984

1983

(g 0, g 1, ... g k)-Trees and Unary OL Systems.

[BibT_eX]

[DOI]

C. L. Liu

Theor. Comput. Sci., 1983

Scheduling in Multibeam Satellites with Interfering Zones.

[BibT_eX]

[DOI]

Maurizio A. Bonuccelli

IEEE Trans. Commun., 1983

An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints.

[BibT_eX]

[DOI]

Yuh-Zen Liao

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1983

Optimal Wiring of Movable Terminals.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1983

Construction of Optimal alpha-beta Leaf Trees with Applications to Prefix Code and Information Retrieval.

[BibT_eX]

[DOI]

David M. Choy

SIAM J. Comput., 1983

Ranking and Unranking of B-Trees.

[BibT_eX]

[DOI]

Udaiprakash I. Gupta

J. Algorithms, 1983

An algorithm for optimal two-dimensional compaction of VLSI layouts.

[BibT_eX]

[DOI]

Martine D. F. Schlag

Yuh-Zen Liao

Integr., 1983

A "Zero-Time" VLSI Sorter.

[BibT_eX]

[DOI]

Glen S. Miranker

Luong Tang

IBM J. Res. Dev., 1983

On the X-Y Convex Hull of a Set of X-Y Polygons.

[BibT_eX]

[DOI]

BIT, 1983

Binary Search Trees with Limited Rotation.

[BibT_eX]

[DOI]

Shou-Hsuan Stephen Huang

BIT, 1983

Algorithmic Studies in Mass Storage Systems.

[BibT_eX]

Computer Science Press, 1983

1982

A conference key distribution system.

[BibT_eX]

[DOI]

Ingemar Ingemarsson

IEEE Trans. Inf. Theory, 1982

Minimizing Packet Waiting Time in a Multibeam Satellite System.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1982

An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams.

[BibT_eX]

[DOI]

Giancarlo Bongiovanni

Maurizio A. Bonuccelli

IEEE Trans. Commun., 1982

Ranking and Unranking of 2-3 Trees.

[BibT_eX]

[DOI]

Udai Gupta

SIAM J. Comput., 1982

Analysis of a General Mass Storage System.

[BibT_eX]

[DOI]

Douglas Stott Parker Jr.

SIAM J. Comput., 1982

1981

Record Allocation for Minimizing Seek Delay.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

Encryption and Authentication in On-Board Processing Satellite Communication Systems.

[BibT_eX]

[DOI]

Ingemar Ingemarsson

IEEE Trans. Commun., 1981

A General Multibeam Satellite Switching Algorithm.

[BibT_eX]

[DOI]

Giancarlo Bongiovanni

IEEE Trans. Commun., 1981

An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders.

[BibT_eX]

[DOI]

Giancarlo Bongiovanni

IEEE Trans. Commun., 1981

An On-Chip Compare/Steer Bubble Sorter.

[BibT_eX]

[DOI]

Hsu Chang

IEEE Trans. Computers, 1981

Tree Search in Major/Minor Loop Magnetic Bubble Memories.

[BibT_eX]

[DOI]

Gian Carlo Bongiovanni

IEEE Trans. Computers, 1981

Finding Intersection of Rectangles by Range Search.

[BibT_eX]

[DOI]

J. Algorithms, 1981

A User Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function.

[BibT_eX]

[DOI]

Ingemar Ingemarsson

Inf. Process. Lett., 1981

Communication: A Number Representation Convertor for Magnetic Bubble String Comparators.

[BibT_eX]

[DOI]

Gian Carlo Bongiovanni

IBM J. Res. Dev., 1981

1980

Quintary Trees: A File Structure for Multidimensional Database Systems.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1980

Construction of a Generalized Connector with 5.8 n log2 n Edges.

[BibT_eX]

[DOI]

K. M. Chung

IEEE Trans. Computers, 1980

A Tree Storage Scheme for Magnetic Bubble Memories.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1980

On the Complexity of Sorting in Magnetic Bubble Memory Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1980

An Efficient Method for Weighted Sampling Without Replacement.

[BibT_eX]

[DOI]

Malcolm C. Easton

SIAM J. Comput., 1980

Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

Minimum Number of Steps for Permutation in a Bubble Memory.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

A New Permutation Algorithm for Bubble Memories.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

On the Complexity of Permuting Records in Magnetic Bubble Memory Systems.

[BibT_eX]

[DOI]

IBM J. Res. Dev., 1980

Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1980

On Some Discrete Optimization Problems in Mass Storage Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

Magnetic Bubble Memory Structures for Efficient Sorting and Searching.

[BibT_eX]

Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

1979

Asymtotically Optimal Interconnection Networks from Two-State Cells.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1979

The Movement and Permutation of Columns in Magnetic Bubble Lattice Files.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1979

On the Number of Comparisons to Find the Intersection of Two Relations.

[BibT_eX]

[DOI]

Larry J. Stockmeyer

SIAM J. Comput., 1979

Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage.

[BibT_eX]

[DOI]

James R. Bitner

SIAM J. Comput., 1979

Upper and lower bounds for graph-diameter problems with application to record allocation.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1979

1978

Dynamic Placement of Records in Linear Storage.

[BibT_eX]

[DOI]

A. C. McKellar

J. ACM, 1978

Bin Packing with Geometric Constraints in Computer Network Design.

[BibT_eX]

[DOI]

A. K. Chandra

Oper. Res., 1978

Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs.

[BibT_eX]

[DOI]

Lawrence T. Kou

Larry J. Stockmeyer

Commun. ACM, 1978

Optimal alpha-beta Trees with Capacity Constraint.

[BibT_eX]

[DOI]

David M. Choy

Acta Informatica, 1978

1977

Dynamic Memories with Faster Random and Sequential Access.

[BibT_eX]

[DOI]

IBM J. Res. Dev., 1977

Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees.

[BibT_eX]

[DOI]

Acta Informatica, 1977

1976

Approximate Algorithms for Some Generalized Knapsack Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

The Generation of Permutations in Magnetic Bubble Memories.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1976

Bounds for the String Editing Problem.

[BibT_eX]

[DOI]

J. ACM, 1976

A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables.

[BibT_eX]

[DOI]

J. ACM, 1976

Data Organization in Magnetic Bubble Lattice Files.

[BibT_eX]

[DOI]

Po Cheung Yue

IBM J. Res. Dev., 1976

1975

Near-Optimal Solutions to a 2-Dimensional Placement Problem.

[BibT_eX]

[DOI]

Richard M. Karp

A. C. McKellar

SIAM J. Comput., 1975

Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1975

The Effect of a Capacity Constraint on the Minimal Cost of a Partition.

[BibT_eX]

[DOI]

Malcolm C. Easton

J. ACM, 1975

Storage cost considerations in secondary index selection.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1975

Near-optimal heuristics for an assignment problem in mass storage.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1975

A Note on the Set Basis Problem Related to the Compaction of Character Sets.

[BibT_eX]

[DOI]

Lawrence T. Kou

Commun. ACM, 1975

1974

Parallel Generation of Binary Search Trees.

[BibT_eX]

[DOI]

Shi-Kuo Chang

IEEE Trans. Computers, 1974

A Combinatorial Problem Related to Multimodule Memory Organizations.

[BibT_eX]

[DOI]

J. ACM, 1974

1973

The Anticipatory Control of a Cyclically Permutable Memory.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1973

On the Optimality of the Probability Ranking Scheme in Storage Applications.

[BibT_eX]

[DOI]

J. ACM, 1973

Upper Bounds for the Total Path Length of Binary Trees.

[BibT_eX]

[DOI]

Jürg Nievergelt

J. ACM, 1973

A Modified Branch-and-Bound Strategy.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1973

A majorization theorem for the number of distinct outcomes in n independent trials.

[BibT_eX]

[DOI]

Discret. Math., 1973

A drum scheduling algorithm.

[BibT_eX]

[DOI]

C. L. Liu

J. Apter

Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

1972

Reconstruction of patterns by block-projection.

[BibT_eX]

[DOI]

Inf. Sci., 1972

Bounds on the Weighted Path Length of Binary Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1972

Sorting by Natural Selection.

[BibT_eX]

[DOI]

W. Donald Frazer

Commun. ACM, 1972

Bounds on Algorithms for String Generation.

[BibT_eX]

[DOI]

A. C. McKellar

Acta Informatica, 1972

1971

On Binary Search Trees.

[BibT_eX]

Jürg Nievergelt