The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- On the reduction of \(LR(k)\) parsers (Q688231) (← links)
- Determining the majority (Q688232) (← links)
- A string-matching algorithm for the CREW PRAM (Q688234) (← links)
- Leftmost one computation on meshes with row broadcasting (Q688236) (← links)
- Optimal simulation of multidimensional reconfigurable meshes by two- dimensional reconfigurable meshes (Q688237) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Integer sorting on a mesh-connected array of processors (Q688438) (← links)
- Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions (Q688439) (← links)
- Static behavior analysis of a mesh system (Q688440) (← links)
- A well-characterized approximation problem (Q688442) (← links)
- Unity properties and sequences of states, some observations (Q688444) (← links)
- Linear speed-up does not hold on Turing machines with tree storages (Q688445) (← links)
- A fast and effective heuristic for the feedback arc set problem (Q688447) (← links)
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- Single jog minimum area joining of compacted cells (Q689614) (← links)
- Optimal speedup of Las Vegas algorithms (Q689615) (← links)
- Optimal parameters for load balancing using the diffusion method in \(k\)- ary \(n\)-cube network (Q689618) (← links)
- Syntactic error repair using repair patterns (Q689620) (← links)
- Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy (Q689622) (← links)
- Inclusion and exclusion algorithm for the Hamiltonian path problem (Q689624) (← links)
- A faster alternative to \(SSS^*\) with extension to variable memory (Q689627) (← links)
- A bounded-space tree traversal algorithm (Q689629) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- An improved LALR\((k)\) parser generation for regular right part grammars (Q689632) (← links)
- Constructor equivalent term rewriting systems (Q689634) (← links)
- Some comments on building heaps in parallel (Q689637) (← links)
- Efficient bottom-up execution of logic programs using abstract interpretation (Q689638) (← links)
- Range-restricted mergeable priority queues (Q689640) (← links)
- A note on ``Scheduling unit-time tasks with integer release times and deadlines'' (Q689642) (← links)
- In-place random list permutations (Q697098) (← links)
- A dynamic fault-tolerant message routing algorithm for double-loop networks (Q697099) (← links)
- A note on equations for commutative regular languages (Q697100) (← links)
- Palindromic rich words and run-length encodings (Q738876) (← links)
- Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
- An efficient algorithm for computing non-overlapping inversion and transposition distance (Q738880) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- A necessary condition for Byzantine \(k\)-set agreement (Q738885) (← links)
- An optimization problem related to neural networks (Q750132) (← links)
- Introduction to design choices in the semantics of Statecharts (Q750133) (← links)
- An optimal algorithm for deleting the root of a heap (Q750135) (← links)
- On the complexity of topological sorting (Q750150) (← links)
- An algorithm for string matching with a sequence of don't cares (Q750152) (← links)
- The effect of the density of states on the Metropolis algorithm (Q750154) (← links)
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (Q750155) (← links)
- Characterization for a family of infinitely many irreducible equally spaced polynomials (Q750156) (← links)
- Analysis of parallel uniform hashing (Q750157) (← links)
- Parallel multiple search (Q750158) (← links)
- On approximating the minimum independent dominating set (Q750159) (← links)
- Program inversion in the refinement calculus (Q750160) (← links)
- A dual algorithm for the satisfiability problem (Q750165) (← links)
