Pages that link to "Item:Q107189"

The following pages link to Journal of Computer and System Sciences (Q107189):

Displaying 50 items.

• Characterizing rational versus exponential learning curves (Q1370864) (← links)
• Approximation and learning of convex superpositions (Q1370865) (← links)
• Learning distributions by their density levels: A paradigm for learning without a teacher (Q1370866) (← links)
• Learning recursive functions from approximations (Q1370868) (← links)
• Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
• Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension (Q1376406) (← links)
• Query languages for bags and aggregate functions (Q1376407) (← links)
• Finitely representable databases (Q1376408) (← links)
• A query language for NC (Q1376409) (← links)
• The complexity of the evaluation of complex algebra expressions (Q1376410) (← links)
• Relative serializability: An approach for relaxing the atomicity of transactions (Q1376414) (← links)
• Can datalog be approximated? (Q1376415) (← links)
• Foundations of computer science (FOCS). Conference, Santa Fe, NM, USA, November 20--22, 1994 (Q1384525) (← links)
• Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
• On the design of reliable Boolean circuits that contain partially unreliable gates (Q1384528) (← links)
• (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
• Size-estimation framework with applications to transitive closure and reachability (Q1384531) (← links)
• Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time (Q1384532) (← links)
• The set of minimal words of a context-free language is context-free (Q1384533) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• Amortization results for chromatic search trees, with an application to priority queues (Q1384535) (← links)
• Shared global states in distributed computations (Q1384536) (← links)
• The Steiner tree problem in orientation metrics (Q1384537) (← links)
• Universally serializable computation (Q1384538) (← links)
• The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors (Q1393121) (← links)
• A generalization of the theory of incompletely specified machines (Q1393206) (← links)
• On periodicity of sequential machines (Q1393387) (← links)
• The efficient calculation of powers of polynomials (Q1393926) (← links)
• On transformations of programs (Q1393935) (← links)
• Program schemes, recursion schemes, and formal languages (Q1393937) (← links)
• Deterministic multitape automata computations (Q1393939) (← links)
• On vector languages (Q1393940) (← links)
• Generalized overlap resolvable grammars and their parsers (Q1393941) (← links)
• Time bounds for selection (Q1394121) (← links)
• A hierarchy for nondeterministic time complexity (Q1394124) (← links)
• Two entropies of a generalized sorting problem (Q1394125) (← links)
• Predecessor machines (Q1394128) (← links)
• A characterization theorem for n-parallel right linear languages (Q1394134) (← links)
• Analysis and application of adaptive sampling (Q1394792) (← links)
• Query containment for data integration systems (Q1394795) (← links)
• Verification of relational transducers for electronic commerce (Q1394796) (← links)
• Typechecking for XML transformers (Q1394797) (← links)
• Generalized substring selectivity estimation (Q1394798) (← links)
• On the content of materialized aggregate views (Q1394799) (← links)
• Reachability and connectivity queries in constraint databases (Q1394800) (← links)
• Indexing moving points (Q1394801) (← links)
• Auditing Boolean attributes (Q1394802) (← links)
• Integrity constraints for XML (Q1394804) (← links)