The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Estimating the range of a function in an online setting (Q294695) (← links)
- A new one pass algorithm for estimating stochastic context-free grammars (Q294698) (← links)
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- Christmas tree: a versatile 1-fault-tolerant design for token rings (Q294701) (← links)
- Very fast and simple approximate string matching (Q294703) (← links)
- Generating all the acyclic orientations of an undirected graph (Q294704) (← links)
- On inferring linear single-tree languages (Q294705) (← links)
- On the Day-Tripathi orientation of the star graphs: connectivity (Q294708) (← links)
- PACS, simple-PAC and query learning (Q294709) (← links)
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
- Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
- Error-detecting codes and fault-containing self-stabilization (Q294717) (← links)
- On the geometry of similarity search: dimensionality curse and concentration of measure (Q294719) (← links)
- On-line scheduling with setup costs (Q294721) (← links)
- Finding OR in a noisy broadcast network (Q294723) (← links)
- Pancyclicity in switching classes (Q294726) (← links)
- Liu and Layland's schedulability test revisited (Q294728) (← links)
- On spanning trees with restricted degrees (Q294729) (← links)
- A note on ``Category and measure in complexity classes'' (Q294730) (← links)
- Domains of partial attributed tree transducers (Q294731) (← links)
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- RNS architectures for the implementation of the `diagonal function' (Q294738) (← links)
- An improved testing scheme for catastrophic fault patterns (Q294739) (← links)
- From binary consensus to multivalued consensus in asynchronous message-passing systems (Q294742) (← links)
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms (Q294745) (← links)
- Worst case examples for operations on OBDDs (Q294746) (← links)
- On finding medians of weighted discrete points (Q294747) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- A conservative scheme for parallel interval narrowing (Q294755) (← links)
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- Statistical delay analysis on an ATM switch with self-similar input traffic (Q294764) (← links)
- On distribution properties of sequences with perfect linear complexity profile (Q294765) (← links)
- Triangulations without minimum-weight drawing (Q294766) (← links)
- A note on the spectral characterization of correlation immune Boolean functions (Q294767) (← links)
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- Randomized uniform self-stabilizing mutual exclusion (Q294769) (← links)
- A concept-based query evaluation with indefinite fuzzy triples (Q294770) (← links)
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (Q294772) (← links)
- On secret set schemes (Q294774) (← links)
- A lower bound for approximating the geometric minimum weight matching (Q294775) (← links)
- Resolving error propagation in distributed systems (Q294777) (← links)
- Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness'' (Q294778) (← links)
- Quorums from difference covers (Q294779) (← links)
- Gödelization in the lambda calculus (Q294781) (← links)
- Abstracting numeric constraints with Boolean functions (Q294784) (← links)
