Amanote Research

Amanote Research

    RegisterSign In

Efficient Searching Using Partial Ordering

Information Processing Letters - Netherlands
doi 10.1016/0020-0190(81)90005-3
Full Text
Open PDF
Abstract

Available in full text

Categories
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
Date

April 1, 1981

Authors
A. BorodinL.J. GuibasN.A. LynchA.C. Yao
Publisher

Elsevier BV


Related search

Partial Enclosure Range Searching

English

DRIFT: Efficient Message Ordering in Ad Hoc Networks Using Virtual Flooding

2006English

Searching Game Trees Under a Partial Order

ICGA Journal
Computational MechanicsComputer GraphicsComputer-Aided DesignComputer ScienceHuman-Computer Interaction
1996English

Efficient Motion Estimation Using Sorting-Based Partial Distortion Search

2006English

Efficient Group of Permutants for Proximity Searching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

CDCL With Less Destructive Backtracking Through Partial Ordering

English

Optimal Allocation Under Partial Ordering of Lifetimes of Components

Advances in Applied Probability
Applied MathematicsStatisticsProbability
1993English

Lanthanide MOFs: Searching for Efficient Solvent-Free Catalysts

Acta Crystallographica Section A Foundations of Crystallography
2012English

Efficient Design of Selective Mapping and Partial Transmit Sequence Using T-Ofdm

IEEE Transactions on Vehicular Technology
Electronic EngineeringAutomotive EngineeringComputer NetworksApplied MathematicsCommunicationsElectricalAerospace Engineering
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy