The following pages link to OpenAlex ID (P388):
Displaying 50 items.
- An active attack on protocols for server-aided RSA signature computation (Q293187) (← links)
- The complexity of scheduling starting time dependent tasks with release times (Q293188) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication (Q293191) (← links)
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- Agreement under faulty interfaces (Q293206) (← links)
- The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
- ANSV problem on BSRs (Q293212) (← links)
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
- The Bandwidth Allocation Problem in the ATM network model is NP-complete (Q293234) (← links)
- 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)
- Shifts and loopless generation of \(k\)-ary trees (Q293252) (← links)
- Starvation-free secure multiversion concurrency control (Q293256) (← links)
- An optimal message routing algorithm for double-loop networks (Q293257) (← 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)
- A study on interleaving versus segmentation (Q293277) (← links)
- Four-state stabilizing phase clock for unidirectional rings of odd size (Q293280) (← 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)
- An inheritance flow model for class hierarchy analysis (Q293289) (← links)
- A homophonic DES (Q293290) (← links)
- Uniform multipaging reduces to paging (Q293296) (← links)
- Successful visual human-computer interaction is undecidable (Q293299) (← links)
- A variation on the zero-one law (Q293304) (← links)
- Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← 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)
- 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)
- Optimal alphabetic trees for binary search (Q293336) (← links)
- Weakest preconditions for pure Prolog programs (Q293340) (← links)
- On the time complexity of minimum and maximum global snapshot problems (Q293343) (← links)
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Pair algebras and Galois connections. (Q293350) (← links)
- An improvement of algorithms for solving interface equations (Q293354) (← links)
- On the complexity of Boolean unification (Q293360) (← links)
- On syntactic nuclei of rational languages (Q293361) (← links)
- Breaking symmetry in complete graphs by orienting edges: asymptotic bounds (Q293364) (← links)
- On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
