default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 51
Volume 51, Number 1, 12 July 1994
- Krzysztof Diks, Evangelos Kranakis
, Danny Krizanc, Bernard Mans, Andrzej Pelc:
Optimal Coteries and Voting Schemes. 1-6 - Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran:
A Note on SpanP Functions. 7-10 - Zhaofang Wen:
New Algorithms for the LCA Problem and the Binary Tree Reconstruction Problem. 11-16 - Shuji Jimbo, Akira Maruoka:
On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables. 17-23 - Ling Chen, Henry Y. H. Chuang:
A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image. 25-29 - Joseph Gil, Yossi Matias:
Designing Algorithms by Expectations. 31-34 - Yoshihide Igarashi, Shingo Osawa, Walter Unger:
Automorphisms of Broadcasting Schemes with Respect to Start Rounds. 35-41 - Antonia Sinachopoulos:
Logics and Decidability for Labelled Pre- and Partially Ordered Kripke Structures. 43-52 - Dan Halperin, Micha Sharir:
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. 53-56
Volume 51, Number 2, 26 July 1994
- Norbert Blum, Henning Rochow:
A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. 57-60 - David A. Basin:
A Term Equality Problem Equivalent to Graph Isomorphism. 61-66 - Michael Frazier, C. David Page Jr.:
Prefix Grammars: An Alternative Characterization of the Regular Languages. 67-71 - Simon R. Blackburn:
Increasing the Rate of Output of m-Sequences. 73-77 - Edith Hemaspaandra:
Census Techniques Collapse Space Classes. 79-84 - Eun-Jung Lee, Kwang-Moo Choe:
Grammar Coverings of a Deterministic Parser with Action Conflicts. 85-92 - Abhijit Sengupta, Suresh Viswanathan:
On Fault-Tolerant Fixed Routing in Hypercubes. 93-99 - Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn:
A Lower Bound for Area-Universal Graphs. 101-105 - Peter Kirrinnis:
An Optimal Bound for Path Weights in Huffman Trees. 107-110
Volume 51, Number 3, 10 August 1994
- Mark Jerrum:
Counting Trees in a Graph is #P-Complete. 111-116 - Erl-Huei Lu, Yi-Chang Chen, Hsiao-Peng Wuu:
A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m. 117-120 - K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston:
A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph. 121-124 - Bapiraju Vinnakota, V. V. Bapeswara Rao:
Enumeration of Binary Trees. 125-127 - Wen-Chin Chen, Wen-Chun Ni:
Internal Path Length of the Binary Representation of Heap-Ordered Trees. 129-132 - Refael Hassin, Shlomi Rubinstein:
Approximations for the Maximum Acyclic Subgraph Problem. 133-140 - Vladimir G. Deineko, René van Dal, Günter Rote:
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. 141-148 - Jayme Luiz Szwarcfiter, Guy Chaty:
Enumerating the Kernels of a Directed Graph with no Odd Circuits. 149-153 - G. Ramalingam, Thomas W. Reps:
On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. 155-161
Volume 51, Number 4, 24 August 1994
- Ching Yu Hung, Behrooz Parhami:
Fast RNS Division Algorithms for Fixed Divisors with Application to RSA Encrytion. 163-169 - André Raspaud, Éric Sopena:
Good and Semi-Strong Colorings of Oriented Planar Graphs. 171-174 - Dominique Barth, André Raspaud:
Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph. 175-179 - K. Sridharan, Harry E. Stephanou, K. C. Craig, S. Sathiya Keerthi:
Distance Measures on Intersecting Objects and Their Applications. 181-188 - Paul Fischer, Klaus-Uwe Höffgen:
Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon. 189-193 - Peng Chen, Shigeru Masuyama:
On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph. 195-199 - Robert Harper:
A Simplified Account of Polymorphic References. 201-206 - David Eppstein:
Arboricity and Bipartite Subgraph Listing Algorithms. 207-211 - Xiao-Dong Hu, P. D. Chen, Frank K. Hwang:
A New Competitive Algorithm for the Counterfeit Coin Problem. 213-218
Volume 51, Number 5, 12 September 1994
- Bo Chen, André van Vliet, Gerhard J. Woeginger:
A Lower Bound for Randomized On-Line Scheduling Algorithms. 219-222 - Eliezer A. Albacea:
Parallel Algorithm for Finding a Core of a Tree Network. 223-226 - Tamal K. Dey, Nimish R. Shah:
Many-Face Complexity in Incremental Convex Arrangements. 227-231 - Jung-Sing Jwo, Tai-Ching Tuan:
On Transmitting Delay in a Distance-Transitive Strongly Antipodal Graph. 233-235 - Xiaojun Shen, Qing Hu, Weifa Liang:
Realization of an Arbitrary Permutation on a Hypercube. 237-243 - Philip M. Long:
Halfspace Learning, Linear Programming, and Nonmalicious Distributions. 245-250 - Lloyd Allison:
Using Hirschberg's Algorithm to Generate Random Alignments of Strings. 251-255 - Yoav Raz:
Serializability by Commitment Ordering. 257-264 - Jordan Gergov:
Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines. 265-269 - Dan Gusfield:
Faster Implementation of a Shortest Superstring Approximation. 271-274
Volume 51, Number 6, 26 September 1994
- Ying The Tsai, Chuan Yi Tang, Yunn Yen Chen:
Average Performance of a Greedy Algorithm for the On-Line Minimum Matching Problem on Euclidean Space. 275-282 - Steven S. Seiden, Daniel S. Hirschberg:
Finding Succinct Ordered Minimal Perfect Hash Functions. 283-288 - Barun Chandra:
Constructing Sparse Spanners for Most Graphs in Higher Dimensions. 289-294 - Micha Hofri:
On Timeout for Global Deadlock Detection in Decentralized Database Systems. 295-302 - Olav Lysne:
Extending Bachmair's Method for Proof by Consistency to the Final Algebra. 303-310 - Alejandro López-Ortiz:
New Lower Bounds for Element Distinctness on a On-Tape Turing Machine. 311-314 - Nikolai N. Kuzjurin:
Multi-Processor Scheduling and Expanders. 315-319 - Vincenzo Acciaro:
On the Complexity of Computing Gröbner Bases in Characteristic 2. 321-323
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-31 22:48 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:
