default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 41
Volume 41, Number 1, 21 January 1992
- Giuseppe Di Battista
, Roberto Tamassia, Ioannis G. Tollis:
Constrained Visibility Representations of Graphs. 1-7 - Jeremy Jacob:
A Model of Reconfiguration in Communicating Sequential Processes with a Notion of Transactions. 9-12 - Massimo Ancona, Claudia Fassino, Vittoria Gianuzzi:
Optimization of LR(k) "Reduced Parsers". 13-20 - M. D. Atkinson, Jörg-Rüdiger Sack:
Generating Binary Trees at Random. 21-23 - P. David Stotts, Parke Godfrey:
Place/Transition Nets with Debit Arcs. 25-33 - Jan K. Pachl:
A Simple Proof of a Completeness Result for leads-to in the UNITY Logic. 35-38 - Calvin Ching-Yuen Chen, Sajal K. Das:
Breadth-First Traversal of Trees and Integer Sorting in Parallel. 39-49 - Pradip K. Srimani, Rachamallu L. N. Reddy:
Another Distributed Algorithm for Multiple Entries to a Critical Section. 51-57 - Jayadev Misra:
Corrigenda: Phase Synchronization. 59
Volume 41, Number 2, 14 February 1992
- Youichi Kobuchi:
Order of State Functions and Logic Functions. 61-66 - Petr Pavlu:
On Efficient Implementation of LR-Attributed Grammars. 67-75 - Carlisle M. Adams:
On Immunity Against Biham and Shamir's "Differential Cryptanalysis". 77-80 - Joachim von zur Gathen:
Processor-Efficient Exponentiation in Finite Fields. 81-86 - René Leermakers:
A Recursive Ascent Earley Parser. 87-91 - Xin Yao:
Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard. 93-98 - Ruei Chuan Chang, Hsuan-Shih Lee:
Finding a Maximum Set of Independent Chords in a Circle. 99-102 - Franz Aurenhammer, Gerd Stöckl:
Searching for Segments with Largest Relative Overlap. 103-108 - Shing-Tsaan Huang, Nian-Shing Chen:
A Self-Stabilizing Algorithm for Constructing Breadth-First Trees. 109-117
Volume 41, Number 3, March 1992
- Luca Gemignani:
Fast Inversion of Hankel and Toeplitz Matrices. 119-123 - Walter W. Kirchherr:
Kolmogorov Complexity and Random Graphs. 125-130 - Jayadev Misra, David Gries:
A Constructive Proof of Vizing's Theorem. 131-133 - Thomas C. Shermer:
A Linear Algorithm for Bisecting a Polygon. 135-140 - Klaas Esseling:
The Order of Appel's Algorithm. 141-147 - Alok Aggarwal:
Parallel Complexity of Computing a Maximal Set of Disjoint Paths. 149-151 - Peter Rajcáni:
Optimal Parallel 3-Coloring Algorithm for Rooted Trees and its Applications. 153-156 - Rakesh M. Verma:
Strings, Trees, and Patterns. 157-161 - Kim S. Larsen, Michael I. Schwartzbach, Erik Meineche Schmidt:
A New Formalism for Relational Algebra. 163-168 - Koichi Wada, Yupin Luo, Kimio Kawaguchi:
Optimal Fault-Tolerant Routings for Connected Graphs. 169-174
Volume 41, Number 4, 18 March 1992
- Andrzej Szalas:
Axiomatizing Fixpoint Logics. 175-180 - Dan Gusfield, Gad M. Landau, Baruch Schieber:
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. 181-185 - L. C. Wu, C. Y. Tang:
Solving the Satisfiability Problem by Using Randomized Approach. 187-190 - Günter Rote, Gerhard J. Woeginger:
Counting Convex k-Gons in Planar Point Sets. 191-194 - Samuel N. Kamin:
Head-Strictness is Not a Monotonic Abstract Property. 195-198 - Samuel R. Buss:
The Graph of Multiplication is Equivalent to Counting. 199-201 - Jaikumar Radhakrishnan:
Improved Bounds for Covering Complete Uniform Hypergraphs. 203-207 - Debra Hoover, Joseph Poole:
A Distributet Self-Stabilizing Solution to the Dining Philosophers Problem. 209-213 - K. Arvind, C. Pandu Regan:
Connected Domination and Steiner Set on Weighted Permutation Graphs. 215-220 - Mikael Goldmann, Johan Håstad:
A Simple Lower Bound for Monotone Clique Using a Communication Game. 221-226 - Eva Ma, Bhagirath Narahari, Lixin Tao:
Optimal Embedding of 2-D Torus Into Ring. 227-231
Volume 41, Number 5, 3 April 1992
- Takayoshi Shoudai:
A P-Complete Language Describable with Iterated Shuffle. 233-238 - Tom Whaley:
Alternative Developments of Cyclic-Permutation Algorithms. 239-241 - Guorong Wang:
An Improved Parallel Algorithm for Computing the Generalized Inverse A+. 243-251 - Igor Rivin, Ramin Zabih:
A Dynamic Programming Solution to the n-Queens Problem. 253-256 - Chandrasekhar Narayanaswami, Wm. Randolph Franklin:
Edge Intersection on the Hypercube Computer. 257-262 - Chun Wa Ko, Frank Ruskey:
Generating Permutations of a Bag by Interchanges. 263-269 - Jorge Urrutia, Fanica Gavril:
An Algorithm for Fraternal Orientation of Graphs. 271-274 - Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Maria Grazia Speranza:
Scheduling Multiprocessor Tasks on Three Dedicated Processors. 275-280 - Mads Dam:
R-Generability, and Definability in Branching Time Logics. 281-287 - Jean Frédéric Myoupo:
Corrigenda: Dynamic Programming on Linear Pipelines. 289
Volume 41, Number 6, 17 April 1992
- Michael Clausen:
Almost all Boolean Functions Have no Linear Symmetries. 291-292 - Fritz Müller:
Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting. 293-299 - Cengiz Erbas, Murat M. Tanik, Zekeriya Aliyazicioglu:
Linear Congruence Equations for the Solutions of the N-Queens Problem. 301-306 - L. L. Miller:
Generating Hinges from Arbitrary Subhypergraphs. 307-312 - Javier Esparza:
A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming. 313-319 - Nader H. Bshouty:
A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial. 321-326 - Eliezer L. Lozinskii:
Counting Propositional Models. 327-332 - Klaus Jansen:
An Approximation Algorithm for the General Routing Problem. 333-339 - Scott D. Carson, Vivek Nirkhe, Paul Vongsathorn:
A Discrete-State Model of the Two-Headed Disk. 341-345 - Jonathan Brandt, Carlos Cabrelli, Ursula Molter:
Corrigendum: An Algorithm for the Computation of the Hutchinson Distance. 347
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-01-04 01: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:
