default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 47
Volume 47, Number 1, August 1993
- Sivan Toledo:
Approximate Parametric Searching. 1-4 - Boris Teia:
A Lower Bound for Randomized List Update Algorithms. 5-9 - Pierluigi Crescenzi
, Riccardo Silvestri:
A Note on the Descriptive Complexity of Maximization. 11-15 - Olumide Owolabi:
Efficient Pattern Searching Over Large Dictionaries. 17-21 - John Hershberger:
A Faster Algorithm for the Two-Center Decision Problem. 23-29 - Michael Meskes, Jörg Noack:
The Generalized Supplementary Magic-Sets Transformation for Stratified Datalog. 31-41 - Wen-Huei Chen, Chuan Yi Tang:
A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem. 43-49 - Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. 51-57
Volume 47, Number 2, 20 August 1993
- Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
On the Union of 0L Languages. 59-63 - Robert Nieuwenhuis:
Simple LPO Constraint Solving Methods. 65-69 - Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu:
Shortest Path Computations in Source-Deplanarized Graphs. 71-75 - Éva Tardos, Vijay V. Vazirani:
Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs. 77-80 - Sanjay Jain, Arun Sharma:
On the Non-Existence of Maximal Inference Degrees for Language Identification. 81-88 - Ming-Shing Yu, Cheng-Hsing Yang:
An O(n) Time Algorithm for Maximum Matching on Cographs. 89-93 - Christophe Hancart:
On Simon's String Searching Algorithm. 95-99 - Sang Ho Lee, Lawrence J. Henschen:
Semantics and Properties of Existential Quantifiers in Deductive Databases. 101-108 - Heonchul Park, Hyoung Joong Kim, Viktor K. Prasanna:
An O(1) Time Optimal Algorithm for Multiplying Matrices on Reconfigurable Mesh. 109-113
Volume 47, Number 3, 14 September 1993
- Matthew J. Katz, Micha Sharir:
Optimal Slope Selection via Expanders. 115-122 - Heung-Chul Shin, Kwang-Moo Choe:
An Improved LALR(k) Parser Generation for Regular Right Part Grammars. 123-129 - Irène Durand, Bruno Salinier:
Constructor Equivalent Term Rewriting Systems. 131-137 - K. Gopalakrishnan, Dean G. Hoffman, Douglas R. Stinson:
A Note on a Conjecture Concerning Symmetric Resilient Functions. 139-143 - Carlo Luchetti, Maria Cristina Pinotti:
Some Comments on Building Heaps in Parallel. 145-148 - Byeong-Mo Chang, Kwang-Moo Choe, Taisook Han:
Efficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation. 149-157 - Jonathan D. Bright:
Range-Restricted Mergeable Priority Queues. 159-164 - George Steiner, Scott Yeomans:
A Note on "Scheduling Unit-Time Tasks with Integer Release Times and Deadlines". 165-166
Volume 47, Number 4, 27 September 1993
- Andrew Lim, Yeow Meng Chee, Siu-Wing Cheng:
Single Jog Minimum Area Joining of Compacted Cells. 167-172 - Michael Luby, Alistair Sinclair, David Zuckerman:
Optimal Speedup of Las Vegas Algorithms. 173-180 - Cheng-Zhong Xu, Francis C. M. Lau:
Optimal Parameters for Load Balancing Using the Diffusion Method in k-Ary n-Cube Networks. 181-187 - In-Sig Yun, Kwang-Moo Choe, Taisook Han:
Syntactic Error Repair Using Repair Patterns. 189-196 - Yi-Bing Lin:
Parallel Trace-Driven Simulation of Packet-Switched Multiplexer Under Priority Scheduling Policy. 197-201 - Eric T. Bax:
Inclusion and Exclusion Algorithm for the Hamiltonian Path Problem. 203-207 - Subir Bhattacharya, Amitava Bagchi:
A Faster Alternative to SSS* with Extension to Variable Memory. 209-214 - Daniel S. Hirschberg, Steven S. Seiden:
A Bounded-Space Tree Traversal Algorithm. 215-219
Volume 47, Number 5, October 1993
- Myung-Soo Kim, Jae-Woo Ahn:
An Algebraic Algorithm to Compute the Exact General Sweep Boundary of a 2D Curved Object. 221-229 - Nageswara S. V. Rao, Ching Luo:
On Similarity of Polynomial Configurations. 231-236 - Byeong-Mo Chang, Kwang-Moo Choe, Taisook Han:
Static Filtering on Stratified Programs. 237-244 - Woo-Jun Park, Myung-Joon Lee, Kwang-Moo Choe:
On the Reduction of LR(k) Parsers. 245-251 - Laurent Alonso, Edward M. Reingold, René Schott:
Determining the Majority. 253-255 - Nalvo F. de Almeida Jr., Valmir Carneiro Barbosa:
A String-Matching Algorithm for the CREW PRAM. 257-259 - Himabindu Gurla:
Leftmost one Computation on Meshes with Row Broadcasting. 261-266 - Ramachandran Vaidyanathan, Jerry L. Trahan:
Optimal Simulation of Multidimensional Reconfigurable Meshes by Two-Dimensional Reconfigurable Meshes. 267-273
Volume 47, Number 6, 18 October 1993
- Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin:
Approximating the Tree and Tour Covers of a Graph. 275-282 - Danny Krizanc:
Integer Sorting on a Mesh-Connected Array of Processors. 283-289 - H. Peter Gumm:
Another Glance at the Alpern-Schneider Characterization of Safety and Liveness in Concurrent Executions. 291-294 - Zhizhang Shen:
Static Behavior Analysis of a Mesh System. 295-299 - Johan Håstad, Steven J. Phillips, Shmuel Safra:
A Well-Characterized Approximation Problem. 301-305 - Rob T. Udink, Joost N. Kok:
Unity Properties and Sequences of States, Some Observations. 307-311 - Martin Hühne:
Linear Speed-Up Does not Hold on Turing Machines with Tree Storages. 313-318 - Peter Eades, Xuemin Lin, W. F. Smyth:
A Fast and Effective Heuristic for the Feedback Arc Set Problem. 319-323 - Danny Z. Chen, Sumanta Guha:
Testing a Simple Polygon for Monotonicity Optimally in Parallel. 325-331
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-01 15:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
