The following pages link to Mathematics Subject Classification ID (P226):
Displaying 50 items.
- On the number of spanning trees of multi-star related graphs (Q293235) (← links)
- Arbitrated unconditionally secure authentication scheme with multi-senders (Q293236) (← links)
- On the richness of the collection of subtrees in random binary search trees (Q293237) (← links)
- A polynomial time solution for labeling a rectilinear map (Q293240) (← links)
- Data sufficiency for queries on cache (Q293243) (← links)
- On learning width two branching programs (Q293246) (← links)
- Optimal availability quorum systems: theory and practice (Q293249) (← links)
- A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
- Shifts and loopless generation of \(k\)-ary trees (Q293252) (← links)
- Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study (Q293254) (← links)
- Starvation-free secure multiversion concurrency control (Q293256) (← links)
- An optimal message routing algorithm for double-loop networks (Q293257) (← links)
- Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm (Q293259) (← links)
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Pattern matching for permutations (Q293263) (← links)
- Automatic proofs and counterexamples for some ortholattice identities (Q293265) (← links)
- The medians of discrete sets (Q293267) (← links)
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- A study on interleaving versus segmentation (Q293277) (← links)
- Four-state stabilizing phase clock for unidirectional rings of odd size (Q293280) (← links)
- A parallel algorithm for circulant tridiagonal linear systems (Q293282) (← links)
- Preface to the special issue on parallel models (Q293283) (← links)
- Scalable and predictable performance for irregular problems using the WPRAM computational model (Q293285) (← links)
- The latency-of-data-access model for analyzing parallel computation (Q293286) (← links)
- An inheritance flow model for class hierarchy analysis (Q293289) (← links)
- A homophonic DES (Q293290) (← links)
- Strongly sequential and inductively sequential term rewriting systems (Q293294) (← links)
- Uniform multipaging reduces to paging (Q293296) (← links)
- Successful visual human-computer interaction is undecidable (Q293299) (← links)
- A data-parallel algorithm for minimum-width tree layout (Q293301) (← links)
- A variation on the zero-one law (Q293304) (← links)
- The homogeneous set sandwich problem (Q293307) (← links)
- Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← links)
- Extending reduction orderings to ACU-compatible reduction orderings (Q293311) (← links)
- Finding the detour-critical edge of a shortest path between two nodes (Q293313) (← links)
- Erratum to ``Revisiting global constraint satisfaction'' (Q293315) (← links)
- Improved algorithms for group testing with inhibitors (Q293316) (← links)
- On fixed priority scheduling, offsets and co-prime task periods (Q293317) (← links)
- Coloring random graphs (Q293318) (← links)
- Learning nearly monotone \(k\)-term DNF (Q293322) (← links)
- On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- Kleene's three-valued logic and process algebra (Q293327) (← links)
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330) (← links)
- Automata and forbidden words (Q293331) (← links)
- Transition systems from event structures revisited (Q293333) (← links)
- An approximation algorithm for the maximum traveling salesman problem (Q293334) (← links)
- Randomized group testing for mutually obscuring defectives (Q293335) (← links)
