The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Lower bounds for sampling algorithms for estimating the average (Q674290) (← links)
- The reachability problem for finite cellular automata (Q674292) (← links)
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive (Q674294) (← links)
- An efficient selection algorithm on the pyramid (Q674295) (← links)
- On key agreement protocols based on tamper-proof hardware (Q674296) (← links)
- Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
- An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh (Q685469) (← links)
- Semantics and properties of existential quantifiers in deductive databases (Q685471) (← links)
- On Simon's string searching algorithm (Q685473) (← links)
- An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs (Q685479) (← links)
- Shortest path computations in source-deplanarized graphs (Q685480) (← links)
- Simple LPO constraint solving methods (Q685481) (← links)
- On the union of 0L languages (Q685483) (← links)
- A lower bound for randomized list update algorithms (Q685486) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem (Q685488) (← links)
- The generalized supplementary magic-sets transformation for stratified Datalog (Q685491) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- Efficient pattern searching over large dictionaries (Q685494) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- Approximate parametric searching (Q685496) (← links)
- Locality in inheritance networks (Q685497) (← links)
- Computational limitations on training sigmoid neural networks (Q685499) (← links)
- A new variation on hypercubes with smaller diameter (Q685501) (← links)
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502) (← links)
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata (Q685507) (← links)
- A note on binomial recurrences arising in the analysis of algorithms (Q685508) (← links)
- Deriving graphical representations of process networks from algebraic expressions (Q685510) (← links)
- Using reliability analysis to estimate the number of generations to convergence in genetic algorithms (Q685512) (← links)
- An efficient implementation of priority queues using fixed-sized systolic coprocessors (Q685514) (← links)
- The power of parallel projection (Q685515) (← links)
- Some problems concerning keys for relation schemes and relations in the relational datamodel (Q685518) (← links)
- Distributed disassembly of mosaics (Q685519) (← links)
- Approximating the minimum maximal independence number (Q685520) (← links)
- Genetic algorithm for feature selection for parallel classifiers (Q685521) (← links)
- Two-dimensional pattern matching by sampling (Q685522) (← links)
- Calculating with procedure calls (Q685524) (← links)
- An efficient algorithm for multiple simultaneous broadcasts in the hypercube (Q685525) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- Diamond deque: A simple data structure for priority deques (Q685528) (← links)
- On random reductions from sparse sets to tally sets (Q685530) (← links)
- Stop-and-copy and one-bit reference counting (Q685532) (← links)
- Analysis of fuzzy operators for high quality information retrieval (Q685535) (← links)
- On the complexity of recursive path orderings (Q685537) (← links)
- An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object (Q688223) (← links)
- On similarity of polynomial configurations (Q688225) (← links)
- Static filtering on stratified programs (Q688228) (← links)
