Publications: Jeffrey Ullman

← Back to Author Profile

  • Affiliation: Professor of Computer Science, Stanford University
  • Google Scholar ID: wUJ2bXgAAAAJ
  • Total Publications: 460

Download CSV for Jeffrey Ullman

Title Year Citations Score
Introduction to Automata Theory, Languages, and Computation
Addison Wesley, 2006
View Details
2006 23284 100.0%
Compilers—principles, techniques, and tools
View Details
1986 18651 99.9%
Mining of massive data sets
Cambridge university press, 2020
View Details
2020 2600 99.8%
Data structures and algorithms
View Details
2015 5098 99.8%
Principles of database systems
Galgotia publications, 1983
View Details
1983 12490 99.8%
Mining of massive datasets
Cambridge University Press, 2011
View Details
2011 2596 99.6%
The theory of parsing, translation, and compiling
Prentice-Hall 1, 309, 1973
View Details
1973 4233 99.4%
Dynamic itemset counting and implication rules for market basket data
Proceedings of the 1997 ACM SIGMOD international conference on Management of …, 1997
View Details
1997 3216 99.4%
Formal languages and their relation to automata
Addison-Wesley Longman Publishing Co., Inc., 1969
View Details
1969 2642 99.4%
Implementing data cubes efficiently
Acm Sigmod Record 25 (2), 205-216, 1996
View Details
1996 2369 99.2%
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Addison-Wesley Longman Publishing Co., Inc., 1977
View Details
1977 2321 99.0%
NP-complete scheduling problems
Journal of Computer and System sciences 10 (3), 384-393, 1975
View Details
1975 2009 98.9%
The TSIMMIS project: Integration of heterogeneous information sources
情報処理学会研究報告データベースシステム (DBS) 1994 (86 (1994-DBS-100)), 7-18, 1994
View Details
1994 1750 98.8%
Computational aspects of VLSI
WH Freeman & Co., 1984
View Details
1984 1610 98.8%
Protection in operating systems
Communications of the ACM 19 (8), 461-471, 1976
View Details
1976 1785 98.4%
The transitive reduction of a directed graph
SIAM Journal on Computing 1 (2), 131-137, 1972
View Details
1972 1052 98.2%
Worst-case performance bounds for simple one-dimensional packing algorithms
SIAM Journal on computing 3 (4), 299-325, 1974
View Details
1974 1267 98.1%
Magic sets and other strange ways to implement logic programs
Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of …, 1985
View Details
1985 1151 97.9%
The TSIMMIS approach to mediation: Data models and languages
Journal of intelligent information systems 8, 117-132, 1997
View Details
1997 1239 97.8%
Universality of data retrieval languages
Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of …, 1979
View Details
1979 917 97.6%
Information integration using logical views
Database Theory—ICDT'97: 6th International Conference Delphi, Greece …, 1997
View Details
1997 1091 97.4%
A first course in database systems
Pearson Education India, 2007
View Details
2007 932 97.4%
Database system implementation
Prentice Hall, 2000
View Details
2000 970 96.6%
Principles of optimal page replacement
Journal of the ACM (JACM) 18 (1), 80-93, 1971
View Details
1971 467 96.2%
Index selection for OLAP
Proceedings 13th International Conference on Data Engineering, 208-219, 1997
View Details
1997 764 96.0%
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS) 4 (3), 297-314, 1979
View Details
1979 584 96.0%
Monotone data flow analysis frameworks
Acta informatica 7 (3), 305-317, 1977
View Details
1977 607 95.9%
Foundations of computer science
Computer Science Press, Inc., 1992
View Details
1992 708 95.9%
The generation of optimal code for arithmetic expressions
Journal of the ACM (JACM) 17 (4), 715-728, 1970
View Details
1970 417 95.5%
An optimal synchronizer for the hypercube
Proceedings of the sixth annual ACM Symposium on Principles of distributed …, 1987
View Details
1987 537 95.3%
Optimizing joins in a map-reduce environment
Proceedings of the 13th International Conference on Extending Database …, 2010
View Details
2010 529 95.2%
On the semantics of updates in databases
Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database …, 1983
View Details
1983 533 95.1%
Equivalences among relational expressions
SIAM Journal on Computing 8 (2), 218-246, 1979
View Details
1979 487 95.0%
Computing Iceberg Queries Effciently
Proceedings of the 1998 VLDB Conference, New York, NY, 1998
View Details
1998 612 94.8%
Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions
SIAM Journal on Computing 10 (3), 405-421, 1981
View Details
1981 478 94.7%
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS) 10 (3), 289-321, 1985
View Details
1985 515 94.6%
Global data flow analysis and iterative algorithms
Journal of the ACM (JACM) 23 (1), 158-171, 1976
View Details
1976 455 94.5%
Finding interesting associations without support pruning
IEEE Transactions on Knowledge and Data Engineering 13 (1), 64-78, 2001
View Details
2001 626 94.4%
Being fluent with information technology
National Academies Press, 1999
View Details
1999 583 94.2%
A survey of deductive database systems
The journal of logic programming 23 (2), 125-149, 1995
View Details
1995 464 93.6%
Translations on a context free grammar
Proceedings of the first annual ACM symposium on Theory of computing, 93-112, 1969
View Details
1969 260 93.4%
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS) 7 (3), 343-360, 1982
View Details
1982 361 93.4%
Compiladores: principios, técnicas y herramientas
Pearson Educación, 1990
View Details
1990 416 93.2%
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie
Pearson Studium, 2002
View Details
2002 521 93.2%
Introduction to automata theory, languages, and computation
Addison-Welsey, NY, 1979
View Details
1979 367 93.2%
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS) 9 (2), 283-308, 1984
View Details
1984 351 92.9%
Elements of ML programming (ML97 ed.)
Prentice-Hall, Inc., 1998
View Details
1998 443 92.5%
Bounds on the complexity of the longest common subsequence problem
Journal of the ACM (JACM) 23 (1), 1-12, 1976
View Details
1976 348 92.2%
Syntax directed translations and the pushdown assembler
Journal of Computer and System Sciences 3 (1), 37-56, 1969
View Details
1969 227 92.2%
Flow graph reducibility
Proceedings of the fourth annual ACM symposium on Theory of computing, 238-250, 1972
View Details
1972 283 92.0%
Answering queries using templates with binding patterns
Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1995
View Details
1995 379 91.9%
The asilomar report on database research
ACM Sigmod record 27 (4), 74-80, 1998
View Details
1998 409 91.8%
On finding lowest common ancestors in trees
Proceedings of the fifth annual ACM symposium on Theory of computing, 253-265, 1973
View Details
1973 266 91.7%
Scalable techniques for mining causal structures
Data Mining and Knowledge Discovery 4, 163-192, 2000
View Details
2000 446 91.6%
Set merging algorithms
SIAM Journal on Computing 2 (4), 294-303, 1973
View Details
1973 259 91.5%
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS) 4 (4), 435-454, 1979
View Details
1979 300 91.3%
Characterizations of reducible flow graphs
Journal of the ACM (JACM) 21 (3), 367-375, 1974
View Details
1974 258 91.2%
Worst-case analysis of memory allocation algorithms
Proceedings of the fourth annual ACM symposium on Theory of computing, 143-150, 1972
View Details
1972 257 91.2%
On notions of information transfer in VLSI circuits
Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983
View Details
1983 292 90.9%
The performance of a memory allocation algorithm
(No Title), 1971
View Details
1971 213 90.9%
Optimizing multiway joins in a map-reduce environment
IEEE Transactions on Knowledge and Data Engineering 23 (9), 1282-1298, 2011
View Details
2011 283 90.6%
Integrating and accessing heterogeneous information sources in TSIMMIS
Proceedings of the AAAI Symposium on Information Gathering 3, 61-64, 1995
View Details
1995 330 90.6%
Database systems: Achievements and opportunities
Communications of the ACM 34 (10), 110-120, 1991
View Details
1991 307 90.1%
Compilerbau
Compilerbau, 1999
View Details
1999 357 90.1%
Querying semistructured heterogeneous information
Deductive and Object-Oriented Databases: Fourth International Conference …, 1995
View Details
1995 296 89.4%
Code generation for expressions with common subexpressions
Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on …, 1976
View Details
1976 238 89.1%
A simple algorithm for global data flow analysis problems
SIAM Journal on Computing 4 (4), 519-532, 1975
View Details
1975 202 89.1%
Medmaker: A mediation system based on declarative specifications
Proceedings of the Twelfth International Conference on Data Engineering, 132-141, 1996
View Details
1996 296 89.0%
A query translation scheme for rapid implementation of wrappers
Deductive and Object-Oriented Databases: Fourth International Conference …, 1995
View Details
1995 285 88.9%
Deterministic parsing of ambiguous grammars
Communications of the ACM 18 (8), 441-452, 1975
View Details
1975 199 88.8%
Maximal objects and the semantics of universal relation databases
ACM Transactions on Database Systems (TODS) 8 (1), 1-14, 1983
View Details
1983 222 88.2%
High-probability parallel transitive closure algorithms
Proceedings of the second annual ACM symposium on Parallel algorithms and …, 1990
View Details
1990 234 87.6%
Representative objects: Concise representations of semistructured, hierarchical data
Proceedings 13th International Conference on Data Engineering, 79-90, 1997
View Details
1997 266 87.4%
Database research: achievements and opportunities into the 1st century
ACM sIGMOD record 25 (1), 52-63, 1996
View Details
1996 258 87.3%
Updating logical databases
Advances in computing research 3, 1-18, 1986
View Details
1986 211 86.9%
Query flocks: A generalization of association-rule mining
Acm sigmod record 27 (2), 1-12, 1998
View Details
1998 258 86.7%
Upper and lower bounds on the cost of a map-reduce computation
arXiv preprint arXiv:1206.4377, 2012
View Details
2012 194 86.6%
Properties of acyclic database schemes
Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981
View Details
1981 195 86.6%
Information integration using logical views
Theoretical Computer Science 239 (2), 189-210, 2000
View Details
2000 276 86.2%
Enumerating subgraph instances using map-reduce
2013 IEEE 29th International Conference on Data Engineering (ICDE), 62-73, 2013
View Details
2013 175 86.1%
Estructuras de datos y algoritmos
View Details
1988 215 85.8%
The design and analysis of computer algorithms Addison-Wesley
Reading, MA 19 (4), 1974
View Details
1974 154 85.7%
The compilation of regular expressions into integrated circuits
Journal of the ACM (JACM) 29 (3), 603-622, 1982
View Details
1982 177 85.7%
The Lowell database research self-assessment
Communications of the ACM 48 (5), 111-118, 2005
View Details
2005 231 85.3%
Polynomial complete scheduling problems
ACM SIGOPS Operating Systems Review 7 (4), 96-101, 1973
View Details
1973 148 85.3%
Bottom-up beats top-down for datalog
Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles …, 1989
View Details
1989 189 85.1%
Some results on tape-bounded Turing machines
Journal of the ACM (JACM) 16 (1), 168-177, 1969
View Details
1969 122 85.0%
Constraint checking with partial information
Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1994
View Details
1994 205 84.8%
Design overview of the NAIL! system
Third International Conference on Logic Programming: Imperial College of …, 1986
View Details
1986 175 84.6%
Universal single transition time asynchronous state assignments
IEEE Transactions on Computers 100 (6), 541-547, 1969
View Details
1969 117 84.5%
Fast algorithms for the elimination of common subexpressions
Acta Informatica 2, 191-213, 1973
View Details
1973 136 84.5%
System/U: a database system based on the universal relation assumption
ACM Transactions on Database Systems (TODS) 9 (3), 331-347, 1984
View Details
1984 162 84.5%
Parallel complexity of logical query programs
Algorithmica 3 (1-4), 5-42, 1988
View Details
1988 192 84.4%
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS) 4 (2), 168-179, 1979
View Details
1979 156 84.1%
Big data: a research agenda
Proceedings of the 17th international database engineering & applications …, 2013
View Details
2013 149 83.5%
Compilers-Princeiples
Techniques, and Tools, 1988
View Details
1988 179 83.5%
Time and tape complexity of pushdown automaton languages
Information and Control 13 (3), 186-206, 1968
View Details
1968 110 83.5%
Properties of syntax directed translations
Journal of Computer and System Sciences 3 (3), 319-334, 1969
View Details
1969 103 82.9%
An approach to a unified theory of automata
The Bell System Technical Journal 46 (8), 1793-1829, 1967
View Details
1967 106 82.8%
Equivalence of relational database schemes
Proceedings of the eleventh annual ACM symposium on Theory of computing, 319-329, 1979
View Details
1979 140 82.6%
Efficient tests for top-down termination of logical rules
Journal of the ACM (JACM) 35 (2), 345-373, 1988
View Details
1988 169 82.6%
On protection in operating systems
Acm Sigops Operating Systems Review 9 (5), 14-24, 1975
View Details
1975 129 82.4%
Capability based mediation in TSIMMIS
Proceedings of the 1998 ACM SIGMOD international conference on Management of …, 1998
View Details
1998 188 82.1%
Fuzzy joins using mapreduce
2012 IEEE 28th International Conference on Data Engineering, 498-509, 2012
View Details
2012 135 80.6%
On the capabilities of codes to correct synchronization errors
IEEE Transactions on Information Theory 13 (1), 95-105, 1967
View Details
1967 92 80.5%
Parsing algorithms with backtrack
11th Annual Symposium on Switching and Automata Theory (SWAT 1970), 153-174, 1970
View Details
1970 78 80.3%
A communication-time tradeoff
SIAM Journal on Computing 16 (4), 639-646, 1987
View Details
1987 131 80.2%
Analysis of a simple algorithm for global data flow problems
Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of …, 1973
View Details
1973 103 80.1%
Database theory—past and future
Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of …, 1987
View Details
1987 130 80.0%
The magazine archive includes every article published in Communications of the ACM for over the past 50 years.
Communications of the ACM 65 (2), 76-91, 2022
View Details
2022 25 79.6%
Introduction to automata theory, languages and computation. adison-wesley
Reading, Mass, 1979
View Details
1979 114 79.5%
Map-reduce extensions and recursive queries
Proceedings of the 14th international conference on extending database …, 2011
View Details
2011 132 79.2%
Information translation, mediation, and mosaic-based browsing in the tsimmis system
SIGMOD Conference, 483, 1995
View Details
1995 143 79.1%
Explainable ai
Communications of the ACM 65 (4), 27-29, 2022
View Details
2022 24 78.8%
Optimal wiring between rectangles
Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981
View Details
1981 111 78.5%
Answering queries using limited external query processors
Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1996
View Details
1996 142 78.4%
Near-optimal, single-synchronization-error-correcting code
IEEE Transactions on Information Theory 12 (4), 418-424, 1966
View Details
1966 66 78.2%
A model of statistical database their security
ACM Transactions on Database Systems (TODS) 2 (1), 1-10, 1977
View Details
1977 101 77.8%
The theory of languages
Mathematical systems theory 2, 97-125, 1968
View Details
1968 77 77.8%
Compilateurs
Principes, techniques et outils. InterEditions, Paris, 1989
View Details
1989 119 77.7%
Database systems: Achievements and opportunities
ACM Sigmod Record 19 (4), 6-22, 1990
View Details
1990 121 77.3%
Evaluating polynomials at fixed sets of points
SIAM Journal on Computing 4 (4), 533-539, 1975
View Details
1975 91 77.0%
The UR strikes back
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database …, 1982
View Details
1982 103 76.9%
Efficient evaluation of right-, left-, and multi-linear rules
ACM SIGMOD Record 18 (2), 235-242, 1989
View Details
1989 113 76.7%
Deadlock-free packet switching networks
Proceedings of the eleventh annual ACM symposium on Theory of computing, 89-98, 1979
View Details
1979 96 76.2%
Nonerasing stack automata
Journal of Computer and System Sciences 1 (2), 166-186, 1967
View Details
1967 68 75.9%
Computing capabilities of mediators
ACM Sigmod Record 28 (2), 443-454, 1999
View Details
1999 136 75.8%
A temporal query system for protocol-directed decision support
Methods of information in medicine 33 (04), 358-370, 1994
View Details
1994 117 75.5%
A comparison between deductive and object-oriented database systems
International Conference on Deductive and Object-Oriented Databases, 263-277, 1991
View Details
1991 106 75.4%
Parallel skyline queries
Proceedings of the 15th International Conference on Database Theory, 274-284, 2012
View Details
2012 102 74.9%
Induction variables in very high level languages
Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on …, 1976
View Details
1976 84 74.7%
Mining of massive datasets
View Details
2014 89 74.5%
Code optimization and finite Church-Rosser systems
(No Title), 1971
View Details
1971 64 74.3%
A general theory of translation
Mathematical Systems Theory 3, 193-221, 1969
View Details
1969 57 73.5%
A scheme for the automatic inference of variable types
Journal of the ACM (JACM) 27 (1), 128-145, 1980
View Details
1980 77 72.6%
Parsing, volume 1 of The Theory of Parsing, Translation and Compiling
Prentice-Hall, 1972
View Details
1972 63 72.0%
Node listings for reducible flow graphs
Proceedings of the seventh annual ACM symposium on Theory of computing, 177-185, 1975
View Details
1975 65 71.2%
Connections in acyclic hypergraphs
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database …, 1982
View Details
1982 76 71.2%
System and method for generating and providing educational exercises
US Patent 7,377,785, 2008
View Details
2008 98 71.0%
Proof-tree transformation theorems and their applications
Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles …, 1989
View Details
1989 81 70.4%
Template dependencies: A large class of dependencies in relational databases and its complete axiomatization
Journal of the ACM (JACM) 29 (2), 363-372, 1982
View Details
1982 72 70.1%
Query optimization for database systems
Principles of Database and Knowledge-Base Systems 2, 633-725, 1989
View Details
1989 79 70.0%
Introdução à teoria de autômatos, linguagens e computação
Rio de Janeiro: Campus, 2002
View Details
2002 101 69.3%
Argument reduction by factoring
Theoretical computer science 146 (1-2), 269-310, 1995
View Details
1995 83 69.0%
Optimization of straight line programs
SIAM Journal on Computing 1 (1), 1-19, 1972
View Details
1972 54 68.7%
The Theory of Parsing, Translation and Compiling. Parsing, vol. I
Prentice-Hall, Englewood Cliffs, 1972
View Details
1972 54 68.7%
Lore: A lightweight object repository for semistructured data
SIGMOD RECORD 25, 549-549, 1996
View Details
1996 83 68.3%
Relations between time and tape complexities
Journal of the ACM (JACM) 15 (3), 414-427, 1968
View Details
1968 44 68.0%
Optimizing large join queries in mediation systems
Database Theory—ICDT’99: 7th International Conference Jerusalem, Israel …, 1999
View Details
1999 87 67.5%
A technique for speeding up LR (k) parsers
Proceedings of the fourth annual ACM symposium on Theory of computing, 251-263, 1972
View Details
1972 52 67.4%
A note on the efficiency of hashing functions
Journal of the ACM (JACM) 19 (3), 569-575, 1972
View Details
1972 52 67.4%
Integrating information by outerjoins and full disjunctions
Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1996
View Details
1996 79 67.3%
The input/output complexity of transitive closure
Annals of Mathematics and Artificial Intelligence 3 (2-4), 331-360, 1991
View Details
1991 69 67.0%
Generating efficient plans for queries using views
ACM SIGMOD Record 30 (2), 319-330, 2001
View Details
2001 88 66.6%
Formal languages and their relation to automata
Reading, Mass.: Addison-Wesley Publishing Company, 1969
View Details
1969 36 66.3%
Modeling communications protocols by automata
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 267-273, 1979
View Details
1979 59 66.3%
Optimization of LR (k) parsers
Journal of Computer and System Sciences 6 (6), 573-602, 1972
View Details
1972 48 66.2%
Bounds on the size and transmission rate of communications protocols
Computers & Mathematics with Applications 8 (3), 205-214, 1982
View Details
1982 58 65.7%
A formal approach to code optimization
ACM SIGPLAN Notices 5 (7), 86-100, 1970
View Details
1970 35 65.7%
Wprowadzenie do teorii automatów, języków i obliczeń
Wydawnictwo Naukowe PWN, 2012
View Details
2012 67 65.0%
The design and analysis of computer
Algorithms, 996-1000, 1974
View Details
1974 46 64.7%
Introducción a los Sistemas de Bases de Datos
Prentice Hall, 1999
View Details
1999 76 64.6%
A characterization of two-way deterministic classes of languages
Journal of Computer and System Sciences 4 (6), 523-538, 1970
View Details
1970 33 64.5%
Postrojenije i analiz vyčislitel'nych algoritmov
Mir, 1979
View Details
1979 52 63.6%
A complete axiomatization for a large class of dependencies in relational datatbases
Proceedings of the twelfth annual ACM symposium on Theory of computing, 117-122, 1980
View Details
1980 49 63.3%
On the complexity of LR (k) testing
Communications of the ACM 18 (12), 707-716, 1975
View Details
1975 43 63.1%
Weak and mixed strategy precedence parsing
Journal of the ACM (JACM) 19 (2), 225-243, 1972
View Details
1972 40 62.9%
Foundations of uncertain-data integration
Proceedings of the VLDB Endowment 3 (1-2), 1080-1090, 2010
View Details
2010 65 62.5%
Kompilatory: reguły, metody, narzędzia
Wydawnictwo Naukowe PWN SA, 2019
View Details
2019 33 62.3%
Introduction to Automata Theory, Languages, and Computation. Adison
Wesley Publishing Company, Reading, Massachusets, USA, 1979
View Details
1979 48 62.0%
The input/output complexity of transitive closure
ACM SIGMOD Record 19 (2), 44-53, 1990
View Details
1990 53 61.3%
The Design and Analysis of Computer Algorithms (1974)
Reading: Addison-Wesley, 207-209, 1987
View Details
1987 50 61.2%
Designing good mapreduce algorithms
XRDS: Crossroads, The ACM Magazine for Students 19 (1), 30-34, 2012
View Details
2012 57 60.8%
Data mining research: opportunities and challenges
A report of three NSF workshops on mining large, massive, and distributed data, 1999
View Details
1999 62 60.6%
A general scheme for the automatic inference of variable types
Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of …, 1978
View Details
1978 41 60.4%
Application of lattice algebra to loop optimization
Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of …, 1975
View Details
1975 38 60.2%
Parsing. The Theory of Parsing, Translation, and Compiling, vol. 1
Prentice-Hall, Englewood Cliffs, 1972
View Details
1972 34 59.9%
Compilers: Principles techniques and tools. 2007
Google Scholar Google Scholar Digital Library Digital Library, 2006
View Details
2006 61 59.7%
Concepts fondamentaux de l'informatique
Dunod, 1993
View Details
1993 49 59.4%
Compilers: Principles, Tools, and Techniques
Addison-Wesley, 1986
View Details
1986 43 59.3%
Implementação de sistemas de banco de dados
Campus, 2001
View Details
2001 61 59.2%
Projektowanie i analiza algorytmów komputerowych
Państwowe Wydaw. Naukowe, 1983
View Details
1983 40 59.0%
The compilation of regular expressions into integrated circuits
21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 260-269, 1980
View Details
1980 38 58.7%
Transitive closure and recursive datalog implemented on clusters
Proceedings of the 15th International Conference on Extending Database …, 2012
View Details
2012 52 58.5%
Abstractions, their algorithms, and their compilers
Communications of the ACM 65 (2), 76-91, 2022
View Details
2022 11 58.4%
Deductive databases: achievements and future directions
ACM SIGMOD Record 19 (4), 75-82, 1990
View Details
1990 45 58.1%
Evaluating computer scientists and engineers for promotion and tenure
Computing Research News, 1999
View Details
1999 55 57.9%
The analysis and design of computer algorithms
Add1~"-son-Wes-------fey-~ Reading, Mass, 1974
View Details
1974 30 57.8%
Code-generation for machines with multiregister operations
Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of …, 1977
View Details
1977 35 57.3%
The Design and Analysis of Computer Algorithms [Russian translation]
Mir, Moscow, 1979
View Details
1979 36 56.6%
Informatik: Datenstrukturen und konzepte der Abstraktion
Internat. Thomson Publ., 1996
View Details
1996 45 56.0%
Mediator languages—a proposal for a standard: report of an I3/POB working group held at the University of Maryland, April 12 and 13, 1996
ACM SIGMOD Record 26 (1), 39-44, 1997
View Details
1997 48 55.9%
On Kent's “Consequences of assuming a universal relation”(Technical correspondance)
ACM Transactions on Database Systems (TODS) 8 (4), 637-643, 1983
View Details
1983 34 55.8%
Structures de données et algorithmes
InterEditions, 1987
View Details
1987 38 55.7%
GYM: A multiround distributed join algorithm
20th International Conference on Database Theory (ICDT 2017), 2017
View Details
2017 34 55.6%
Sharesskew: An algorithm to handle skew for joins in mapreduce
Information Systems 77, 129-150, 2018
View Details
2018 30 55.2%
Construction and analysis of computational algorithms
World, 1979
View Details
1979 34 55.2%
Rationale and design considerations for a semantic mediator in health information systems
Methods of information in medicine 37 (04/05), 518-526, 1998
View Details
1998 45 54.7%
An n log n algorithm for detecting reducible graphs
Proe. 6th Annual Princeton Conf. on Inf. Sciences and Systems, 119-122, 1972
View Details
1972 26 54.4%
Minimizing view sets without losing query-answering power
Database Theory—ICDT 2001: 8th International Conference London, UK, January …, 2001
View Details
2001 47 54.1%
Sets accepted by one-way stack automata are context sensitive
Information and Control 13 (2), 114-133, 1968
View Details
1968 24 54.1%
Efficient Implementation of Data Cubes Via Materialized Views.
KDD, 386-388, 1996
View Details
1996 41 54.1%
Formálne jazyky a automaty
Alfa, 1978
View Details
1978 29 53.8%
Podstawowy wykład z systemów baz danych
Wydawnictwa Naukowo-Techniczne, 2001
View Details
2001 46 53.7%
Transformations on straight line programs-(Preliminary Version)
Proceedings of the second annual ACM symposium on Theory of computing, 136-148, 1970
View Details
1970 18 53.2%
Best practices memo: evaluating computer scientists and engineers for promotion and tenure
Computing Research News 11 (4), A-B, 1999
View Details
1999 43 53.1%
The complexity of ordering subgoals
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles …, 1988
View Details
1988 35 52.9%
On complementary and independent mappings on databases
Proceedings of the 1984 ACM SIGMOD international conference on Management of …, 1984
View Details
1984 30 52.8%
GYM: A multiround join algorithm in mapreduce
arXiv preprint arXiv:1410.4156, 2014
View Details
2014 38 52.8%
The design and analysis of computer algorithms
Addison-Wesley, Reading, Mass, 1974
View Details
1974 23 52.6%
The theory of parsing, translation, and compiling
Prentice-Hall, 1972
View Details
1972 24 52.6%
Fragments of relations
ACM SIGMOD Record 13 (4), 15-22, 1983
View Details
1983 29 52.5%
Systemy baz danych: Pełny wykład
Wydawnictwa Naukowo-Techniczne, 2006
View Details
2006 42 51.6%
On the equivalence of logical databases
Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database …, 1984
View Details
1984 28 51.4%
Evaluating, combining and generalizing recommendations with prerequisites
Proceedings of the 19th ACM international conference on Information and …, 2010
View Details
2010 40 51.3%
Systemy baz danych
Wydawnictwa Naukowo-Techniczne, 1988
View Details
1988 32 51.1%
Dynamic memories with rapid random and sequential access
IEEE Transactions on Computers 100 (3), 272-276, 1974
View Details
1974 21 50.8%
Economy of description by parsers, DPDA's, and PDA's
Theoretical Computer Science 4 (2), 143-153, 1977
View Details
1977 26 50.7%
アルゴリズムの設計と解析
(No Title), 1977
View Details
1977 26 50.7%
A SURVEY OF DATA FLOW ANALYSIS TECHNIQUES.
View Details
1975 23 49.9%
The interaction between functional dependencies and template dependencies
Proceedings of the 1980 ACM SIGMOD international conference on Management of …, 1980
View Details
1980 24 49.9%
Deterministic stack automata and the quotient operator
Journal of Computer and System Sciences 2 (1), 1-12, 1968
View Details
1968 20 49.7%
Tools for template dependencies
SIAM Journal on Computing 12 (1), 36-59, 1983
View Details
1983 25 49.4%
TheDesignandAnalysisofComputerAlgorithms
Addison-Wesley, 1974
View Details
1974 20 49.4%
Shift-shuffle memory system with rapid sequential access
US Patent 3,810,112, 1974
View Details
1974 20 49.4%
Operations on sparse relations
Communications of the ACM 20 (3), 171-176, 1977
View Details
1977 24 49.2%
The Theory of Parsing, Translation and Compiling
View Details
1972 20 49.0%
Testing applicability of top-down capture rules
Department of Computer Science, Stanford University, 1985
View Details
1985 27 49.0%
Assigning an appropriate meaning to database logic with negation
Computers as Our Better Partners, 216-225, 1994
View Details
1994 31 48.9%
Formal Languages and their Relation to Automata Addison
Reading, MA, 1969
View Details
1969 15 48.5%
Directed graphs
Data structures and algorithms, 219-221, 1983
View Details
1983 23 47.9%
Experience with a regular expression compiler
Department of Computer Science, Stanford University, 1983
View Details
1983 23 47.9%
Fundamental concepts of programming systems
Addison-Wesley Longman Publishing Co., Inc., 1976
View Details
1976 22 47.8%
The Design and Analysis of Computer Algorithms, Add ison
Wesley Publishing Company, Reading, Massachusetts, 1974
View Details
1974 18 47.2%
Operations on sparse relations and efficient algorithms for grammar problems
15th Annual Symposium on Switching and Automata Theory (swat 1974), 127-132, 1974
View Details
1974 18 47.2%
Vision paper: Towards an understanding of the limits of map-reduce computation
arXiv preprint arXiv:1204.1754, 2012
View Details
2012 32 47.0%
Complexity of a top-down capture rule
Department of Computer Science, Stanford University, 1984
View Details
1984 22 46.6%
Widom J
Podstawowy wykład z systemów baz danych, Wydawnictwa Naukowo-Techniczne …, 2000
View Details
2000 32 46.4%
On the computational power of pushdown automata
Journal of Computer and System Sciences 4 (2), 129-136, 1970
View Details
1970 13 45.8%
Logical query optimization by proof-tree transformation
Journal of Computer and System Sciences 47 (1), 222-248, 1993
View Details
1993 24 45.8%
Correcting faults in write-once memory
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
View Details
1984 21 45.7%
Error correction for formal languages
(No Title), 1966
View Details
1966 13 45.6%
Schema Design for Uncertain Databases.
AMW, 2009
View Details
2009 30 45.5%
Universal two state machines: Characterization theorems and decomposition schemes
9th Annual Symposium on Switching and Automata Theory (swat 1968), 413-426, 1968
View Details
1968 16 45.4%
Implementacja systemów baz danych
Wydawnictwa Naukowo-Techniczne, 2003
View Details
2003 29 44.9%
Decidable and undecidable questions about automata
Journal of the ACM (JACM) 15 (2), 317-324, 1968
View Details
1968 15 44.3%
Finding the depth of a flow graph
Proceedings of the eighth annual ACM symposium on Theory of computing, 121-125, 1976
View Details
1976 18 44.2%
Using views to generate efficient evaluation plans for queries
Journal of Computer and System Sciences 73 (5), 703-724, 2007
View Details
2007 28 43.5%
A version numbering scheme with a useful lexicographical order
Proceedings of the Eleventh International Conference on Data Engineering …, 1995
View Details
1995 22 43.0%
Principles of Database and Knowledge_Base systems, Volume I
Computer Science Press, 1988
View Details
1988 20 42.7%
Automi, linguaggi e calcolabilità
Pearson Education Italia, 2003
View Details
2003 25 42.4%
Data structures and algorithms (1983)
Google Scholar Google Scholar Digital Library Digital Library, 1983
View Details
1983 17 42.2%
D. 1986. Compilers—Principles, Techniques, and Tools
Murray Hill, New Jersey: Bell Telephone Laboratories Inc, 1983
View Details
1983 17 42.2%
Exploring the ontology of surgical procedures in the Read Thesaurus
Methods of Information in Medicine 37 (04/05), 420-425, 1998
View Details
1998 23 42.0%
Flux, sorting, and supercomputer organization for AI applications
Journal of Parallel and Distributed Computing 1 (2), 133-151, 1984
View Details
1984 17 41.9%
Einführung in die Automatentheorie, formale Sprachen und Berechenbarkeit
Pearson Deutschland GmbH, 2011
View Details
2011 25 41.6%
Error detection in precedence parsers
Mathematical systems theory 7 (2), 97-113, 1973
View Details
1973 14 41.0%
Partitioned data security on outsourced sensitive and non-sensitive data
2019 IEEE 35th International Conference on Data Engineering (ICDE), 650-661, 2019
View Details
2019 15 40.8%
Introduction to Automata Theory, Languages, and Complexity
Addison-Wesley, Reading, 1979
View Details
1979 16 40.6%
The theory of parsing, translation, and compiling. Englewoods Cliffs
NJ: Prentice-Hall, 1972
View Details
1972 13 40.5%
Projektowanie i analiza algorytmów
Helion, 2003
View Details
2003 22 40.3%
Algorytmy i struktury danych
Helion, 2003
View Details
2003 22 40.3%
Principles of database design
Stanford 9, 89, 1980
View Details
1980 14 39.7%
Adequacy of decompositions of relational databases
Advances in Data Base Theory: Volume 1, 101-114, 1981
View Details
1981 15 39.6%
Adatbázisrendszerek: alapvetés
Panem, 1998
View Details
1998 20 39.6%
Database system implementation
Published by 3, 2000
View Details
2000 21 39.4%
Dynamic miss-counting algorithms: Finding implication and similarity rules with confidence pruning
Proceedings of 16th International Conference on Data Engineering (Cat. No …, 2000
View Details
2000 21 39.4%
Design and Analysis ofAlgorithms
Addison-Wesley, Reading, Mass, 1974
View Details
1974 12 39.2%
Panda: Partitioned data security on outsourced sensitive and non-sensitive data
ACM Transactions on Management Information Systems (TMIS) 11 (4), 1-41, 2020
View Details
2020 12 39.2%
Querying websites using compact skeletons
Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2001
View Details
2001 20 39.1%
Storing and querying tree-structured records in Dremel
Proceedings of the VLDB Endowment 7 (12), 1131-1142, 2014
View Details
2014 21 39.0%
Convergence of sideways query evaluation
Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of …, 1985
View Details
1985 16 38.9%
Improving the efficiency of database-system teaching
Proceedings of the 2003 ACM SIGMOD international conference on Management of …, 2003
View Details
2003 20 38.8%
Uniform synthesis of sequential circuits
Bell System Technical Journal 48 (5), 1115-1127, 1969
View Details
1969 10 38.8%
Einführung in die Automatentheorie
Formale Sprachen und Komplexitätstheorie, Bonn, 1990
View Details
1990 16 38.8%
Equivalence of programs with structured variables
Journal of Computer and System Sciences 6 (2), 125-137, 1972
View Details
1972 11 37.9%
数据库系统基础教程
北京: 清华大学出版社, 1999
View Details
1999 18 37.5%
Some thoughts about supercomputer organization
Stanford University, Department of Computer Science, 1983
View Details
1983 13 37.5%
Gradiance on-line accelerated learning
Proceedings of the Twenty-eighth Australasian conference on Computer Science …, 2005
View Details
2005 19 37.4%
The database approach to knowledge representation
PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, 1346-1349, 1996
View Details
1996 16 37.3%
The Design and Analysis of Algorithms. Addison and Wesley
Reading, MA, 1974
View Details
1974 11 37.1%
Data science education: We're missing the boat, again
2017 IEEE 33rd international conference on data engineering (ICDE), 1473-1474, 2017
View Details
2017 16 36.8%
U11-man
Compilers-Principles, Techniques, and Tools, 176-183, 1986
View Details
1986 13 36.8%
The revenge of the JD
Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database …, 1983
View Details
1983 12 36.2%
The Design and Analysis of Computer Algorithms
Addison-Wesley, 1974
View Details
1974 10 36.0%
Compiladores. Principios, técnicas y herramientas
Addison Wesley Longman (Pearson), 1998
View Details
1998 16 36.0%
The care and feeding of LR (k) grammars
Proceedings of the third annual ACM symposium on Theory of computing, 159-170, 1971
View Details
1971 9 35.3%
Universality of data retrieval languages, 6th ACM Symp. on Principles of Program
Languages, 1979
View Details
1979 12 35.0%
A survey of association-rule mining
International Conference on Discovery Science, 1-14, 2000
View Details
2000 15 34.2%
Querying semistructured heterogeneous information
Journal of Systems Integration 7, 381-407, 1997
View Details
1997 14 34.1%
The design and analysis of computer algorithms, ex. 2.12
Addison-Wesley, Reading, 1974
View Details
1974 9 34.0%
Compilers: Principles, techniques and tools, 2nd editio
Pearson Higher Education, 2007
View Details
2007 16 33.9%
Halting stack automata
Journal of the ACM (JACM) 16 (4), 550-563, 1969
View Details
1969 8 33.7%
Medmaker: A mediation system based on declarative specifications. Available by anonymous ftp at db
stanford. edu as the le/pub/papakonstantinou/1995/medmaker. ps, 1995
View Details
1995 13 33.7%
The equivalence of universal relation definitions
Computer Science Department, Stanford University, 1982
View Details
1982 11 33.7%
Data Mining Research: Opportunities and Challenges, A Report of three NSF Workshops on Mining Large, Massive, and Distributed Data
supported in part by NSF Grant IRI-9802160, available at: www. ncdm. uic …, 1999
View Details
1999 14 33.6%
Cluster computing, recursion and datalog
Datalog Reloaded: First International Workshop, Datalog 2010, Oxford, UK …, 2011
View Details
2011 16 33.5%
データ構造とアルゴリズム
(No Title), 1987
View Details
1987 11 33.4%
Assignment problems of different-sized inputs in MapReduce
ACM Transactions on Knowledge Discovery from Data (TKDD) 11 (2), 1-35, 2016
View Details
2016 14 32.6%
Anchor points algorithms for hamming and edit distance
Proceedings of ICDT, 2014
View Details
2014 15 32.5%
Dimensionality reduction
Mining of Massive Datasets, 415-447, 2014
View Details
2014 15 32.5%
The Battle for Data Science.
IEEE Data Eng. Bull. 43 (2), 8-14, 2020
View Details
2020 9 32.0%
Compilateurs: principes, techniques et outils: cours et exercices
Dunod, 2000
View Details
2000 13 32.0%
Efficient and complete tests for database integrity constraint checking
International Workshop on Principles and Practice of Constraint Programming …, 1994
View Details
1994 12 31.8%
Számítógép-algoritmusok tervezése és analízise
Műszaki K., 1982
View Details
1982 10 31.7%
Struktury dannykh i algoritmy [Data structures and algorithms]
Moscow," Vilyams" Publ, 2003
View Details
2003 12 31.1%
The Theory of Parsing, Translation and Compiling. Parsing, vol. 1. Parsing. Printice-Hall
Inc., Englewood Cliffs, 1972
View Details
1972 8 30.8%
オートマトン 言語理論 計算論 I
サイエンス社, 1984
View Details
1984 9 30.7%
Theory of Parsing, Translation, and Compiling [Rusian translation], Vol. 1
Mir, Moscow, 1978
View Details
1978 8 30.4%
Two results on one-way stack automata
8th Annual Symposium on Switching and Automata Theory (SWAT 1967), 37-44, 1967
View Details
1967 6 30.4%
Meta-MapReduce: A technique for reducing communication in MapReduce computations
arXiv preprint arXiv:1508.01171, 2015
View Details
2015 13 30.2%
On the convergence of query evaluation
Journal of Computer and System Sciences 38 (2), 341-359, 1989
View Details
1989 10 30.1%
Data and Knowledge-Base Systems-Volume II
Computer science press, 1989
View Details
1989 10 30.1%
Introduction to Algorithms and Data Structures
Addison-Wesley, 1982
View Details
1982 9 29.9%
Optimal algorithms for structural assembly
VLSI Design 3 (2), 38-42, 1982
View Details
1982 9 29.9%
The lowell report
Proceedings of the 2003 ACM SIGMOD international conference on Management of …, 2003
View Details
2003 11 29.9%
数据库系统全书
机械工业出版社, 2003
View Details
2003 11 29.9%
New frontiers in database system research
Conference Organized by INRIA, France, 87-101, 1992
View Details
1992 10 29.7%
The interface between language theory and database theory
Theoretical studies in computer science, 133-151, 1992
View Details
1992 10 29.7%
Applications of language theory to compiler design
Proceedings of the May 16-18, 1972, spring joint computer conference, 235-242, 1971
View Details
1971 7 28.9%
コンパイラ: 原理・技法・ツール
サイエンス社, 1990
View Details
1990 9 28.8%
FAQtor: Automatic FAQ generation using online forums
International Conference on Educational Data Mining, 529-532, 2018
View Details
2018 10 28.8%
Versions, configurations, and constraints in CEDB
CIFE Working Paper 31, Center for Integrated Facilities Engineering …, 1994
View Details
1994 10 28.8%
Compiler Construction
Addison-Wessley, 1984
View Details
1984 8 28.7%
Viewpoint Advising students for success
Communications of the ACM 52 (3), 34-37, 2009
View Details
2009 11 28.6%
Matching bounds for the all-pairs mapreduce problem
Proceedings of the 17th International Database Engineering & Applications …, 2013
View Details
2013 12 28.5%
Designing good algorithms for MapReduce and beyond
Proceedings of the Third ACM Symposium on Cloud Computing, 1-2, 2012
View Details
2012 12 28.5%
Run-time environments
Compilers: Principles, Techniques, and Tools, Addison-Welsey, 389-462, 1986
View Details
1986 8 27.9%
Experiments as research validation: Have we gone too far?
Communications of the ACM 58 (9), 37-39, 2015
View Details
2015 11 27.4%
Bounds for Overlapping Interval Join on MapReduce.
EDBT/ICDT Workshops, 3-6, 2015
View Details
2015 11 27.4%
A new computation model for cluster computing
Tech. Rep., 2009
View Details
2009 10 27.2%
A linear list merging algorithm
View Details
2008 10 27.1%
Evaluating relational expressions with dense and sparse arguments
SIAM Journal on Computing 6 (1), 109-122, 1977
View Details
1977 7 27.0%
Fondamenti di informatica
Zanichelli, 1994
View Details
1994 9 27.0%
A report of three NSF workshops on mining large, massive, and distributed data
Data Mining Research: Opportunities and Challenges, National Science …, 1999
View Details
1999 9 26.7%
Data structures and algorithms
View Details
1983 7 26.7%
Computational Aspects of VLSI
Computer Science Press, 1984
View Details
1984 7 26.1%
Foundations of computer science
WH Freeman, 1995
View Details
1995 8 26.0%
Implementing Data Cubes E ciently
Proc. ACM SIGMOD 96, 1995
View Details
1995 8 26.0%
Finite automata
Introduction to Automata Theory Languages and Computation, S. Rivas, Ed …, 1979
View Details
1979 7 26.0%
Index selection for olap
Proceedings for 13th International Conference on Data Engineering, 208-219, 1997
View Details
1997 8 25.4%
Wykłady z informatyki z przykładami w języku C
Wydaw. Helion, 2003
View Details
2003 8 25.3%
The design and algorithm of computer algorithms
Addison-Wesley, Reading, MA, 1974
View Details
1974 6 24.9%
The De-sign and Analysis of
Computer Algorithms, 1974
View Details
1974 6 24.9%
Computing marginals using MapReduce
Journal of Computer and System Sciences 94, 98-117, 2018
View Details
2018 8 24.9%
Automated training and evaluation
US Patent App. 11/146,515, 2005
View Details
2005 8 24.8%
Compilers Principles
Techniques, & Tools, Addion Wesley, 2006
View Details
2006 8 24.6%
ULLMAN: Magic sets and other strange ways to implement logic programs
ACM (Herausgeber): PODS 86, 24-26, 1985
View Details
1985 7 24.4%
Clustering
Mining of massive datasets, 239-278, 2012
View Details
2012 9 24.2%
Clustering
Mining of massive datasets, 241-280, 2012
View Details
2012 9 24.2%
Syntax-directed translation
Compilers: Principles, Techniques, Tools. Reading, Mass.: Addison-Wesley, 33-40, 1988
View Details
1988 7 24.1%
Medmaker: a mediation system based on declarative specification
Technical report, Stanford University, 1995
View Details
1995 7 23.9%
The role of theory today
ACM Computing Surveys (CSUR) 27 (1), 43-44, 1995
View Details
1995 7 23.9%
Information integration
Database System Implementation. 1st ed. Upper Saddle River, 595-641, 2001
View Details
2001 7 23.6%
Introducción a la teoría de autómatas, lenguajes y computación
CECSA, 1997
View Details
1997 7 23.4%
An approach to processing queries in a logic-based query language
On Knowledge Base Management Systems: Integrating Artificial Intelligence …, 1986
View Details
1986 6 23.1%
Compilers: Principles, Techniques, and Tools
Addison-Wesley, 1986
View Details
1986 6 23.1%
Combining state machines and regular expressions for automatic synthesis of vlsi circuits
Department of Computer Science, Stanford University, 1982
View Details
1982 6 23.0%
Shasta: Interactive reporting at scale
Proceedings of the 2016 International Conference on Management of Data, 1393 …, 2016
View Details
2016 8 23.0%
Compilers: Principles, Techniques and Tools, of International ed
Pearson: London, UK, 2006
View Details
2006 7 22.8%
A new computation model for rack-based computing
Submitted to PODS 2010, 2009
View Details
2009 7 22.4%
On the computational power of pushdown store systems
unpublished manuscript, September, 1967
View Details
1967 4 22.3%
Efficient and private approximations of distributed databases calculations
2017 IEEE International Conference on Big Data (Big Data), 4487-4496, 2017
View Details
2017 7 21.8%
Syntactic pattern recognition of intermittent EEG activity
Methods of information in medicine 24 (02), 79-84, 1985
View Details
1985 6 21.8%
Classical database systems
(No Title), 1988
View Details
1988 6 21.6%
Systemy baz danych: kompletny podręcznik
Wydawnictwo Helion, 2011
View Details
2011 7 21.5%
JD; WIDOM, J
Implementação de Bancos de Dados. Rio de Janeiro-RJ: Campus, 2001
View Details
2001 6 21.4%
IntroductiontoAutomataTheory, LanguagesandComputation
2ndEdition. US: Addison Wesley, 2001
View Details
2001 6 21.4%
A survey of research in deductive database systems
J. Logic Programming, 125-149, 1995
View Details
1995 6 21.3%
A programming and problem solving seminar
Department of Computer Science, Stanford University, 1991
View Details
1991 6 21.2%
Characterizations and extensions of pushdown translations
Mathematical systems theory 5 (2), 172-192, 1971
View Details
1971 5 21.0%
言語理論とオートマトン
(No Title), 1971
View Details
1971 5 21.0%
The tsimmis project: Integration of heterogeneous information sources
proceedings of IPSJ, Tokyo, Japan, 1994
View Details
1994 6 20.9%
The Tsimmis project: Integration of heterogeneous information sources
16th Meeting of the Information Processing Society of Japan, 1994
View Details
1994 6 20.9%
Mapreduce algorithms
Proceedings of the 2nd IKDD Conference on Data Sciences, 1-1, 2015
View Details
2015 7 20.8%
Compiler: Prinzipien, Techniken und Werkzeuge
Pearson Deutschland GmbH, 2008
View Details
2008 6 20.0%
Formal languages and their rela~ on to automata
Reading, Mass.: Addison-Wesley Publishing Co, 1969
View Details
1969 4 19.8%
Introduction to Compiling
Compilers, Principles, Techniques, and Tools. Reading: Addison-Wesley …, 1986
View Details
1986 5 19.8%
Introduction to Automata Theory, Languages, and Computation. international ed
Boston [etc.]: Person Addison Wesley, 2007
View Details
2007 6 19.8%
The design of hashing functions
(No Title), 1970
View Details
1970 4 19.7%
Introduction to Au-tomata Theory, Languages and Computation,(-Wesley, Read-ing
View Details
1979 5 19.7%
The theory of functional and template dependencies
Theoretical Computer Science 17 (3), 317-331, 1982
View Details
1982 5 19.5%
Ullman. Principles of Database Systems
Computer Science Press, 1982
View Details
1982 5 19.5%
Compiladores
Pearson Educación de México SA de CV, 2011
View Details
2011 6 19.5%
Chapter 9 Recommendation Systems
Mining of massive datasets, 2012
View Details
2012 6 18.9%
Assignment of different-sized inputs in mapreduce
arXiv preprint arXiv:1501.06758, 2015
View Details
2015 6 18.7%
Estructuras de datos y algoritmos
Sistemas Tecnicos de Edicion, 1988
View Details
1988 5 18.5%
Vvedenie v teoriyu avtomatov, yazykov i vychislenii [Introduction to Automata Theory, Languages, and Computation]
Moscow, Vil'yams Publ, 2002
View Details
2002 5 18.4%
编译原理技术与工具 (英文版)
北京: 人民邮电出版社, 2002
View Details
2002 5 18.4%
C3: Changes, consistency, and configurations in heterogeneous distributed information systems
Unpublished project description, available through the URL http://www-db …, 1995
View Details
1995 5 18.3%
introducción a la Teoría de Autómatas
Lenguajes y computación, 1993
View Details
1993 5 18.3%
Introduction to Automata Theory, Languages, andComputation
Addison Wesley, 2006
View Details
2006 5 18.2%
The MIDAS data-mining project at Stanford
Proceedings. IDEAS'99. International Database Engineering and Applications …, 1999
View Details
1999 5 18.2%
Decoupling IPv7 from robots in context-free grammar
Proceedings of FOCS, 1999
View Details
1999 5 18.2%
The Design and Analysis of Computer Algorithms, pages: 206-210, publisher
Addison-Wesley, Mass, 1974
View Details
1974 4 17.6%
Linear precedence functions for weak precedence grammars
International Journal of Computer Mathematics 3 (1-4), 149-155, 1972
View Details
1972 4 17.2%
Pushdown automata with bounded backtrack
SDC, Santa Monica, California, 1965
View Details
1965 3 17.2%
Concise essence-preserving big data representation
2016 IEEE International Conference on Big Data (Big Data), 3662-3665, 2016
View Details
2016 5 16.4%
Updating logical databases
Advances in Computing Research 3, 1986
View Details
1986 4 16.4%
A Survey of Formal Language Theory
Proc. First Ann. Princeton Conf. on Info. Sci. and Syst, 68-75, 1967
View Details
1967 3 16.2%
Data Structures and Algorithms Addison-Wesley Reading
Massachusetts, 1982
View Details
1982 4 16.1%
Deductive Databases: Challenges, opportunities and future directions: A Panel Discussion with the Participation
International Workshop on Logic in Databases, 223-229, 1996
View Details
1996 4 15.7%
21st Century Compilers
Pearson Addison Wesley, 2004
View Details
2004 4 15.4%
J. Widom,“Querying Semistructured Heterogeneous Information”
Proc. of DOOD Conference, 1995
View Details
1995 4 15.3%
NSF workshop on industrial/academic cooperation in database systems
ACM SIGMOD Record 28 (1), 115-130, 1999
View Details
1999 4 15.3%
Ullmann: Compilerbau
zwei Bänden. Das» Drachenbuch «. Das Standard-Lehrbuch, das alle Methoden …, 1997
View Details
1997 4 15.3%
The theory of deductive database systems
1990 Thirty-Fifth IEEE Computer Society International Conference on …, 1990
View Details
1990 4 15.2%
The input/output complexity of transitive closure (1990)
SIGMOD Rec 19 (2), 44-53, 1990
View Details
1990 4 15.2%
Database Systems
The complete Book, 2009
View Details
2009 4 15.2%
Validating Constraints with Partial Information: Research Overview.
DAISD, 375-385, 1994
View Details
1994 4 15.1%
Lexical analysis
Compilers: Principles, Techniques, & Tools, 109-114, 2008
View Details
2008 4 14.9%
Introduction to Automata Theory, Languages, and Computation, 3rd edn. Series in Computer Science
Education. Pearson Education India, 2007
View Details
2007 4 14.7%
Efficient and privacy preserving approximation of distributed statistical queries
IEEE Transactions on Big Data 8 (5), 1399-1413, 2021
View Details
2021 3 14.3%
The design and analysis of computer algorithms
Addison-Wesley, 1976
View Details
1976 3 13.9%
Efficient multiway hash join on reconfigurable hardware
Performance Evaluation and Benchmarking for the Era of Cloud (s) 11th TPC …, 2020
View Details
2020 3 12.4%
Lr (k) grammars
The theory of parsing, translation, and compiling 1, 371-379, 1972
View Details
1972 3 12.3%
Logic and database systems
On Knowledge Base Management Systems: Integrating Artificial Intelligence …, 1986
View Details
1986 3 12.2%
Query processing in universal relation systems
IEEE Database Eng. Bull. 5 (3), 6-10, 1982
View Details
1982 3 12.2%
A First Course In Database Systems (3Rd
View Details
2022 2 12.1%
Index Selection for OLAP
Proc. of ICDE97, 1996
View Details
1996 3 11.9%
The impact of efficient modalities on electrical engineering
Proceedings of MOBICOM, 2003
View Details
2003 3 11.9%
Capability based mediation in TSIMMIS
SIGMOD 98 Demo, Seattle, June, 1998
View Details
1998 3 11.5%
Podstawowy kurs systemów baz danych
Helion, 2011
View Details
2011 3 11.3%
Panel: the state of data: invited paper from panelists
Proceedings of the 20th International Database Engineering & Applications …, 2016
View Details
2016 3 10.7%
An approach to a unified theory of automata
Bell System Technical Journal 46 (8), 1793-1829, 1967
View Details
1967 2 9.5%
Asymptotic complexity of partial fraction expansion
View Details
1975 2 8.3%
Algorytmy+ struktury danych
Wydawnictwa Naukowo-Techniczne, 1980
View Details
1980 2 8.0%
Template dependencies
unpubl. manuscript, Stanford Univ, 1980
View Details
1980 2 8.0%
Principles of Compiler Design. 2nd printing
USA: Addison-Wesley.(Aho & Ullman, 1978), 1978
View Details
1978 2 7.5%
Security in Statistical Data Bases
Princeton University. Department of Electrical Engineering, 1976
View Details
1976 2 7.5%
THE COMPLEXITY OF CODE GENERATION.
View Details
1976 2 7.5%
A communication-time tradeoff
Department of Computer Science, Stanford University, 1983
View Details
1983 2 7.3%
Principles of database systemsComputer Sc
Press, 1983
View Details
1983 2 7.3%
Efficient multiway hash join on reconfigurable hardware
arXiv preprint arXiv:1905.13376, 2019
View Details
2019 2 7.3%
Syntax analysis
Compilers Principles, Techniques and Tools, 159-277, 1986
View Details
1986 2 6.9%
lFinite Automata lRegular Expressions
Introduction to automata theory, languages, and computation, New York …, 2006
View Details
2006 2 6.9%
Context-Free Grammars
Introduction to Automata Theory, Languages, and Computation, 77-106, 2006
View Details
2006 2 6.9%
Introducción a la teoría de autómatas, lenguajes y computación''
México: COMPAÑÍA EDITORIAL CONTINENTAL 1, 447, 2002
View Details
2002 2 6.9%
Adatbázisrendszerek megvalósítása
Panem, 2001
View Details
2001 2 6.9%
Jure Leskovec
View Details
2010 2 6.6%
Information Integration
Database System Implementation, Prentice Hall, 595-612, 1999
View Details
1999 2 6.5%
Be FIT
Being fluent with information technology, Washington/DC, 1999
View Details
1999 2 6.5%
Handling skew in multiway joins in parallel processing
arXiv preprint arXiv:1504.03247, 2015
View Details
2015 2 6.4%
Some pairs problems
Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for …, 2016
View Details
2016 2 6.4%
Systemy baz danych. Kompletny podręcznik. Wydanie II
View Details
1991 2 6.2%
A view of directions in relational database theory
Automata, Languages and Programming: Eighth Colloquium Acre (Akko), Israel …, 1981
View Details
1981 1 0.0%
Brief-announcement: Meta-MapReduce: A technique for reducing communication in MapReduce computations
Stabilization, Safety, and Security of Distributed Systems-17th …, 2015
View Details
2015 1 0.0%
Построение и анализ вычислительных алгоритмов
(No Title), 1979
View Details
1979 1 0.0%
Lav integration of uncertain data
Tech. rep. 2008-31, Stanford InfoLab, 2008
View Details
2008 1 0.0%
Brief announcement: Assignment of different-sized inputs in MapReduce
Distributed Computing-28th International Symposium, DISC 2014, Austin, TX …, 2014
View Details
2014 1 0.0%
A recognition algorithm for pushdown store systems
Proceedings of the 1968 23rd ACM national conference, 597-604, 1968
View Details
1968 1 0.0%
A survey of new directions in database systems
Eighth International Conference on Database Systems for Advanced …, 2003
View Details
2003 1 0.0%
Minimizing view sets without losing queryanswering power (extended version)
Technical report, Computer Science Dept., Stanford Univ., http://dbpubs …, 2000
View Details
2000 1 0.0%
Compilers: Principles, Techniques, and Tools</TITLE
Addison-Wesley</PUBLISHER, 1985
View Details
1985 1 0.0%
JE Hop croft
Data structures and algorithms. Pub. A ddision-Wesley, April1987, 1972
View Details
1972 1 0.0%
Dynamic memories with rapid random and sequential access
Bell Laboratories. Computing Science, 1973
View Details
1973 1 0.0%
Endliche Automaten
Einführung in die Automatentheorie, Formale Sprachen und Komplexitätstheorie …, 2002
View Details
2002 1 0.0%
A First Course in Database Systems (ed.)
Upper, 2008
View Details
2008 1 0.0%
Big Data Management and Analytics
Association for Computing Machinery, 2015
View Details
2015 1 0.0%
Report from the third workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR'16)
ACM SIGMOD Record 46 (2), 43-48, 2017
View Details
2017 1 0.0%