yusuke1997/dblp-id-title huggingface dataset:
Minimum Weighted Completion Time
Superiority and Complexity of the Spaced Seeds
Curve Reconstruction
Permutation Enumeration
Suffix Tree Construction in Hierarchical Memory
Dictionary Matching and Indexing (Exact and with Errors)
Compressed Tree Representations
Parallel Connectivity and Minimum Spanning Trees
Learning Heavy Fourier Coefficients of Boolean Functions
Quantum Error Correction
Document Retrieval on String Collections
Fully Dynamic Minimum Spanning Trees
Fully Dynamic Connectivity
Quantum Algorithm for Finding Triangles
Decremental Approximate-APSP in Directed Graphs
Multiway Cut
Online Node-Weighted Problems
FPGA Technology Mapping
Burrows-Wheeler Transform
Min-Sum Set Cover and Its Generalizations
Quantum Algorithms for Systems of Linear Equations
Sequential Multiple String Matching
Sorting by Transpositions and Reversals (Approximate Ratio 1.5)
Atomic Selfish Flows
Approximate String Matching
Sliding Window Algorithms
Exact Graph Coloring Using Inclusion-Exclusion
Certificate Complexity and Exact Learning
Complexity of Bimatrix Nash Equilibria
Exact Algorithms for General CNF SAT
Truthful Multicast
Self-Assembly at Temperature 1
Multi-level Feedback Queues
Adaptive Partitions
Estimating Simple Graph Parameters in Sublinear Time
Vertex Cover Data Reduction
RNA Secondary Structure Prediction by Minimum Free Energy
Max Leaf Spanning Tree
Minimum Energy Cost Broadcasting in Wireless Networks
Complexity Dichotomies for Counting Graph Homomorphisms
Compressing and Indexing Structured Text
Smoothed Analysis
Online List Update
Rank and Select Operations on Sequences
Oblivious Routing
Asynchronous Consensus Impossibility
Attribute-Efficient Learning
Multiplex PCR for Gap Closing (Whole-genome Assembly)
Simpler Approximation for Stable Marriage
Generalized Two-Server Problem
List Ranking
Mobile Agents and Exploration
Self-Stabilization
Radiocoloring in Planar Graphs
List Scheduling
Single-Source Fully Dynamic Reachability
Lempel-Ziv Compression
Algorithm DC-Tree for k-Servers on Trees
Faires Teilen: Eine Weihnachtsstollengeschichte
Faster Deterministic Fully-Dynamic Graph Connectivity
Approximate Membership
Probe Selection
Approximating Fixation Probabilities in the Generalized Moran Process
Strategyproof
Learning Constant-Depth Circuits
Optimal Probabilistic Synchronous Byzantine Agreement
Two-Level Boolean Minimization
Weighted Popular Matchings
Das Travelling Salesman Problem
Algorithm DC-Tree for kServers on Trees
Predecessor Search
Block Edit Distance
Approximating Metric Spaces by Tree Metrics
Atomic Network Congestion Games
Atomic Scan
BG Distributed Simulation Algorithm
Parameterized Algorithms for Drawing Graphs
Topology Approach in Distributed Computing
Quickest Route
Exact Algorithms and Strong Exponential Time Hypothesis
Counting by ZDD
Euclidean Traveling Salesman Problem
Influence and Profit
Randomized Searching on Rays or the Line
Approximation Schemes for Planar Graph Problems
Quantum Algorithm for Solving the Pell's Equation
Metric TSP
Dynamic Trees
Two-Interval Pattern Problems
Kernelization, Polynomial Lower Bounds
XML Compression and Indexing
Clustered Graph Drawing
Greedy Set-Cover Algorithms
Linearity Testing/Testing Hadamard Codes
Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks
Enumeration of Paths, Cycles, and Spanning Trees
Sequential Approximate String Matching
Exact Algorithms for Induced Subgraph Problems
Ranked Matching
Rumor Blocking
Degree-Bounded Trees
Gate Sizing
Distributed Algorithms for Minimum Spanning Trees
Efficient Polynomial Time Approximation Scheme for Scheduling Jobs onUniform Processors
Statistical Query Learning
Gomory-Hu Trees
Adwords Pricing
Two-Player Nash
Consensus with Partial Synchrony
Steiner Forest
Table Compression
Mellor-Crummey and Scott Mutual Exclusion Algorithm
Approximate Dictionaries
Approximation Algorithms in Planar Graphs
Voting Systems
Statistical Timing Analysis
Best Response Algorithms for Selfish Routing
Truthful Mechanisms for One-Parameter Agents
Euclidean Graphs and Trees
Experimental Implementation of Tile Assembly
Thresholds of Random k -Sat
Majority Equilibrium
Leontief Economy Equilibrium
Quantum Dense Coding
Randomized Rounding
Two-Player Game
Testing Juntas and Related Properties of Boolean Functions
High Performance Algorithm Engineering for Large-Scale Problems
Current Champion for Online Bin Packing
Symmetric Graph Drawing
Implementation Challenge for TSP Heuristics
Engineering Algorithms for Computational Biology
Locally Testable Codes
Force-Directed Graph Drawing
Geometric Spanners
Distributed Computing for Enumeration
Local Search Algorithms for kSAT
Nash Equilibria and Dominant Strategies in Routing
Circuit Retiming: An Incremental Approach
Sorting of Multi-Dimensional Keys
Sparse Graph Spanners
Closest String and Substring Problems
Analyzing Cache Misses
Boosting Textual Compression
Negative Cycles in Weighted Digraphs
Wait-Free Synchronization
Complexity of Core
Vector Bin Packing
Approximation Schemes for Makespan Minimization
Weighted Random Sampling
Distributed Randomized Broadcasting in Wireless Networks under the SINR Model
Amortized Analysis on Enumeration Algorithms
Phylogenetic Tree Construction from a Distance Matrix
Dynamic Problems
Smooth Surface and Volume Meshing
Minimum Geometric Spanning Trees
Mehrheitsbestimmung - Wer wird Klassensprecher?
Learning with Malicious Noise
Message Adversaries
Compressing Integer Sequences
Quantum Approximation of the Jones Polynomial
Single-Source Shortest Paths
Bin Packing oder "Wie bekomme ich die Klamotten in die Kisten?"
All Pairs Shortest Paths via Matrix Multiplication
Intersections of Inverted Lists
Trial and Error Algorithms
Peptide De Novo Sequencing with MS/MS
Low Stretch Spanning Trees
Dilation of Geometric Networks
Direct Routing Algorithms
Parameterized Matching
Public-Key-Kryptographie
Shortest Elapsed Time First Scheduling
Turnier- und Sportligaplanung
Monotone Minimal Perfect Hash Functions
Rank and Select Operations on Binary Strings
Maximum Agreement Subtree (of 3 or More Trees)
Backtracking Based k -SAT Algorithms
Learning Significant Fourier Coefficients over Finite Abelian Groups
Obstacle Avoidance Algorithms in Wireless Sensor Networks
Triangle Finding
I/O-Model
Geographic Routing
Private Spectral Analysis
Atomic Multicast
Haplotype Inference on Pedigrees Without Recombinations
Facility Location
Der One-Time-Pad-Algorithmus: Der einfachste und sicherste Verschlüsselungsalgorithmus
Computing Pure Equilibria in the Game of Parallel Links
Suffix Trees and Arrays
Stochastic Scheduling
Succinct Encoding of Permutations: Applications to Text Indexing
Block-Sorting Data Compression
Scheduling with Unknown Job Sizes
All-Distances Sketches
Distributed Snapshots
Geometric Shortest Paths in the Plane
Quantum Algorithm for the Parity Problem
Compressed Range Minimum Queries
Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs
Broadcasting in Geometric Radio Networks
Rate-Monotonic Scheduling
Kernelization, Max-Cut Above Tight Bounds
Quantization of Markov Chains
Binary Decision Graph
Market Games and Content Distribution
TSP-Based Curve Reconstruction
Approximation Schemes for Bin Packing
Lower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover
LP Based Parameterized Algorithms
Canonical Orders and Schnyder Realizers
Packet Routing
Truthful
Fully Dynamic Higher Connectivity for Planar Graphs
Minimum Congestion Redundant Assignments
Two-Dimensional Compressed Matching
Online Learning and Optimization
Quantum Algorithm for Checking Matrix Identities
Algorithms for Spanners in Weighted Graphs
Analyzing Cache Behaviour in Multicore Architectures
Performance-Driven Clustering
Cache-Oblivious B-Tree
University Admissions Problem
Max-Min Allocation
Packet Switching in Multi-queue Switches
Predecessor Search, String Algorithms and Data Structures
Constructing a Galled Phylogenetic Network
Kleinster umschließender Kreis. (Ein Demokratiebeitrag aus der Schweiz?)
Speed Scaling
Schnelle Sortieralgorithmen
Multicommodity Flow, Well-linked Terminals and Routing Problems
Minimum Energy Broadcasting in Wireless Geometric Networks
Arbitrage in Frictional Foreign Exchange Market
Flow Time Minimization
Optimal Two-Level Boolean Minimization
Maximum-Density Segment
Two-Dimensional Scaled Pattern Matching
Min-Hash Sketches
Slicing Floorplan Orientation
Local Alignment (with Concave Gap Weights)
Hardness of Proper Learning
Competitive Auction
Nearest Neighbor Interchange and Related Distances
Reducing Bayesian Mechanism Design to Algorithm Design
3D Conforming Delaunay Triangulation
Online Preemptive Scheduling on Parallel Machines
Orienteering Problems
Perfect Phylogeny Haplotyping
Maximum-Average Segments
Fully Dynamic Planarity Testing
Planarisation and Crossing Minimisation
Weighted Connected Dominating Set
Packet Switching in Multi-Queue Switches
Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?
Vector Scheduling Problems
Approximate Periodicities
Dictionary-Based Data Compression
Kernelization, Constraint Satisfaction Problems Parameterized above Average
Computing Cutwidth and Pathwidth of Semi-complete Digraphs
Musite: Tool for Predicting Protein Phosphorylation Sites
Das Rucksackproblem
Rate Adjustment and Allocation
Data Reduction for Domination in Graphs
Tiefensuche (Ariadne und Co.)
Random Planted 3-SAT
Kinetic Data Structures
Holant Problems
Uniform Covering of Rings and Lines by Memoryless Mobile Sensors
General Equilibrium
Selfish Bin Packing Problems
Online Scheduling
Deterministic Searching on the Line
Beyond Hypergraph Dualization
Maximum Compatible Tree
Well Separated Pair Decomposition for Unit-Disk Graph
File Caching and Sharing
Harmonic Algorithm for Online Bin Packing
Kernelization, Turing Kernels
Dominating Set
Approximate Regular Expression Matching
Large-Treewidth Graph Decompositions
Online-Algorithmen: Was ist es wert, die Zukunft zu kennen?
Query Release via Online Learning
Regular Expression Indexing
Graph Connectivity
Cache-Oblivious Spacetree Traversals
Directed Perfect Phylogeny (Binary Characters)
Engineering Geometric Algorithms
Non-shared Edges
Texte durchsuchen - aber schnell! Der Boyer-Moore-Horspool Algorithmus
Fast Subset Convolution
Indexed Two-Dimensional String Matching
Using Visualization in the Empirical Assessment of Algorithms
Randomized Minimum Spanning Tree
Efficient Decodable Group Testing
AMS Sketch
Robustness in Self-Assembly
Bargaining Networks
Graph Bandwidth
Testing Bipartiteness of Graphs in Sublinear Time
Connected Dominating Set
Orthogonal Range Searching on Discrete Grids
Trade-Offs for Dynamic Graph Problems
Work-Function Algorithm for k Servers
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach
Independent Sets in Random Intersection Graphs
Encyclopedia of Algorithms - 2016 Edition
Intrinsic Universality in Self-Assembly
Computational Learning
Fehlererkennende Codes: Was ist eigentlich EAN?
Knowledge in Distributed Systems
Approximating the Diameter
Prophet Inequality and Online Auctions
Hamilton Cycles in Random Intersection Graphs
Coordination Ratio
Grammar Compression
Triangulation Data Structures
Distance Oracles for Sparse Graphs
Wake-Up Problem in Multi-Hop Radio Networks
Enumeration of Non-crossing Geometric Graphs
Global Routing
Power Grid Analysis
Rectilinear Steiner Tree
Randomized Parallel Approximations to Max Flow
Approximate Dictionary Matching
Maximale Flüsse - Die ganze Stadt will zum Stadion
Causal Order, Logical Clocks, State Machine Replication
Implementation Challenge for Shortest Paths
Bin Packing, Variants
Staged Assembly
Vertex Cover Preprocessing
Exact Algorithms on Graphs of Bounded Average Degree
Subexponential Parameterized Algorithms
Randomized Contraction
Squares and Repetitions
Cache-Oblivious Sorting
Symbolic Model Checking
Communication in Ad Hoc Mobile Networks Using Random Walks
Voltage Scheduling
Quantum Key Distribution
Incentive Compatible Selection
Delaunay Triangulation and Randomized Constructions
Quantification of Regulation in Networks with Positive and Negative Interaction Weights
Approximate Maximum Flow Construction
Sequential Exact String Matching
Approximate Nash Equilibrium
Edit Distance Under Block Operations
Circuit Retiming
Stackelberg Games: The Price of Optimum
Error-Control Codes, Reed-Muller Code
Circuit Placement
Approximate Repetitions
Multiplikation langer Zahlen (schneller als in der Schule)
Maximum Agreement Supertree
Matroids in Parameterized Complexity and Exact Algorithms
Modularity Maximization in Complex Networks
Kernelization, Exponential Lower Bounds
Routing in Road Networks with Transit Nodes
Boolean Formulas
Selfish Unsplittable Flows: Algorithms for Pure Equilibria
Kernelization, Permutation CSPs Parameterized above Average
Routing-Cost Constrained Connected Dominating Set
Undirected Feedback Vertex Set
Wait-Free Shared Variables
Kernelization, Partially Polynomial Kernels
Fully Dynamic Transitive Closure
Exact Algorithms for Dominating Set
Similarity Between Compressed Strings
O(log log n)-Competitive Binary Search Tree
Multiple String Matching
Backtracking Based k-SAT Algorithms
Scheduling with Equipartition
Rank and Select Operations on Bit Strings
Wait-Free Registers
Geometric Approaches to Answering Queries
Voronoi Diagrams and Delaunay Triangulations
Algorithmic Mechanism Design
Sparse Fourier Transform
Separators in Graphs
Revenue Monotone Auctions
Minimal Dominating Set Enumeration
Clustering Under Stability Assumptions
Oblivious Subspace Embeddings
Universal Sequencing on an Unreliable Machine
Cryptographic Hardness of Learning
Decremental All-Pairs Shortest Paths
Planarity Testing
Colouring Non-sparse Random Intersection Graphs
Multidimensional String Matching
Non-approximability of Bimatrix Nash Equilibria
Holographic Algorithms
Broadcast Scheduling - Minimizing Average Response Time
Steiner Trees
Branchwidth of Graphs
Wire Sizing
Vertex Coloring
Planar Geometric Spanners
Maximizing the Minimum Machine Load
First Fit Algorithm for Bin Packing
Secretary Problems and Online Auctions
Optimal Radius
Scheduling with a Reordering Buffer
Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds
Approximation Algorithm
Experimental Methods for Algorithm Analysis
Truthful Multicast Routing
Wait-Free Renaming
Matching in Dynamic Graphs
Online Paging and Caching
Exact Algorithms for Bandwidth
Shortest Paths Approaches for Timetable Information
Greedy Approximation Algorithms
False-Name-Proof Auction
Compressed Representations of Graphs
Parallel Algorithms for Two Processors Precedence Constraint Scheduling
Das Sieb des Eratosthenes: Wie schnell kann man eine Primzahlentabelle berechnen?
Parameterized Pattern Matching
Hierarchical Space Decompositions for Low-Density Scenes
Sphere Packing Problem
Synchronizers, Spanners
Approximation Algorithm Design
Stable Marriage with One-Sided Ties
Maximum-scoring Segment with Length Restrictions
Optimal Triangulation
Extremal Problems
Kernelization, Preprocessing for Treewidth
Stochastic Knapsack
Dynamic Approximate-APSP
Fast Minimal Triangulation
O(log log n)-competitive Binary Search Tree
Hitting Set
Local Search for K-medians and Facility Location
Memory-Constrained Algorithms
Tail Bounds for Occupancy Problems
Gewinnstrategie für ein Streichholzspiel
Stable Matching
Tree Compression and Indexing
LEDA: a Library of Efficient Algorithms
Nucleolus
Stable Marriage with Ties and Incomplete Lists
Wait-Free Consensus
List Decoding near Capacity: Folded RS Codes
Multiple Unit Auctions with Budget Constraint
Zyklensuche in Graphen
Quantum Algorithms for Graph Connectivity
Routing in Geometric Networks
Bidimensionality
Vertex Cover Search Trees
Connectivity and Fault Tolerance in Random Regular Graphs
Quantum Algorithms for Simulated Annealing
Multitolerance Graphs
Gauß-Seidel Iteration zur Berechnung physikalischer Probleme
Reversal Distance
Quantum Algorithm for Search on Grids
Tree Agreement
Self-Assembly of Fractals
Kernelization, Bidimensionality and Kernels
Concurrent Programming, Mutual Exclusion
Range Searching
Vertex Cover Kernelization
Simple Algorithms for Spanners in Weighted Graphs
High Performance Algorithm Engineering for Large-scale Problems
Active Self-Assembly and Molecular Robotics with Nubots
Graph Sketching
Spanning Trees with Low Average Stretch
Influence Maximization
Closest Substring
Beyond Worst Case Sensitivity in Private Data Analysis
Suffix Tree Construction
Zahlen auf Deutsch aussprechen
Rectilinear Spanning Tree
Nowhere Crownful Classes of Directed Graphs
Frequent Pattern Mining
Lowest Common Ancestors in Trees
Poker per E-Mail
Atomic Broadcast
Maximum Cardinality Stable Matchings
Convex Hulls
Connected Set-Cover and Group Steiner Tree
Compressed Suffix Trees
Data Stream Verification
Compressed Text Indexing
Alternate Parameterizations
Teilen von Geheimnissen
Randomized Self-Assembly
Multiplex PCR for Gap Closing (Whole-Genome Assembly)
Abstract Voronoi Diagrams
Maximum Two-Satisfiability
Model Checking with Fly-Automata
Broadcasting: Wie verbreite ich schnell Informationen?
Quantum Search
Valid-Utility Games
Maximum Lifetime Coverage
Minimale aufspannende Bäume (Wenn das Naheliegende das Beste ist... )
Hierarchical Self-Assembly
Multiple String Alignment
Metrical Task Systems
Approximating the Partition Function of Two-Spin Systems
Online Interval Coloring
Randomization in Distributed Computing
Sortieren durch Einfügen
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
PageRank: Was ist wichtig im World Wide Web?
Unique k -SAT and General k -SAT
Multi-Hop Radio Networks, Ad Hoc Networks
Subset Sum Algorithm for Bin Packing
Well Separated Pair Decomposition
Minimum Makespan on Unrelated Machines
Two-Person Game
Warehouse Location
Encyclopedia of Algorithms - 2008 Edition
Kernelization, Planar F-Deletion
Packet Switching in Single Buffer
Work-Function Algorithm for k-Servers
Alternative Performance Measures in Online Algorithms
Maximum Matching
Distance-Based Phylogeny Reconstruction (Fast-Converging)
t-Spanners
Fixed-Parameter Approximability and Hardness
Minimum Connected Sensor Cover
Text Indexing
Planar Maximum Flow - Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
Substring Parsimony
Robust Geometric Computation
Ad-Hoc Networks
Exact Algorithms for Maximum Independent Set
Algorithmic Cooling
Sugiyama Algorithm
Distributed Vertex Coloring
Geometric Object Enumeration
Temperature Programming in Self-Assembly
Similarity between Compressed Strings
Locally Decodable Codes
Minimum k -Connected Geometric Networks
Quantum Algorithm for the Discrete Logarithm Problem
Sparsest Cut
String Sorting
Local Reconstruction
Paralleles Sortieren - Parallel geht schnell
Global Minimum Cuts in Surface-Embedded Graphs
Spanning Ratio
Dynamische Programmierung: Evolutionäre Distanz
Suffix Tree Construction in RAM
Convex Graph Drawing
Hospitals/Residents Problems with Quota Lower Bounds
Recursive Separator Decompositions for Planar Graphs
VCG
Split Decomposition via Graph-Labelled Trees
Shortest Route
Double Partition
Automated Search Tree Generation
Robust Bin Packing
Testing Bipartiteness in the Dense-Graph Model
Online Load Balancing of Temporary Tasks
Clique Enumeration
Jamming-Resistant MAC Protocols for Wireless Networks
Applications of Geometric Spanner Networks
Compressing Integer Sequences and Sets
Self-Assembly with General Shaped Tiles
Fault-Tolerant Connected Dominating Set
Topologisches Sortieren - Mit welcher Aufgabe meiner ToDo-Liste fange ich an?
Manifold Reconstruction
Incremental Algorithms
Stretch Factor
Additive Spanners
Quadtrees and Morton Indexing
Lower Bounds for Online Bin Packing
Statistical Data Compression
Quantum Analogues of Markov Chains
Testing if an Array Is Sorted
Quantum Algorithm for Element Distinctness
Distance-Based Phylogeny Reconstruction (Optimal Radius)
Mechanism Design and Differential Privacy
Strongly Connected Dominating Set
Hub Labeling (2-Hop Labeling)
Parity Games
Zufallszahlen: Wie kommt der Zufall in den Rechner?
Tree Enumeration
Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!
Exact Quantum Algorithms
LexBFS, Structure, and Algorithms
Taschenbuch der Algorithmen
Suffix Array Construction
Statistical Multiple Alignment
k -Best Enumeration
Beyond Evolutionary Trees
Optimal Crowdsourcing Contests
Compressed Document Retrieval on String Collections
Differentially Private Analysis of Graphs
Memoryless Gathering of Mobile Robotic Sensors
Weighted Caching
Geometric Computing
Euclidean Traveling Salesperson Problem
Pattern Matching on Compressed Text
Planar Maximum s - t Flow
Multilinear Monomial Detection
Compressed Pattern Matching
Self-Assembly of Squares and Scaled Shapes
Two-Dimensional Pattern Matching with Scaling
Block Shaping in Floorplan
Truthful Auctions
Layout Decomposition for Multiple Patterning
Layout Decomposition for Triple Patterning
Exponential Lower Bounds for k -SAT Algorithms
Frequent Graph Mining
Scheduling in Data Broadcasting
Bend Minimization for Orthogonal Drawings of Plane Graphs
Indexed Regular Expression Matching
Patterned Self-Assembly Tile Set Synthesis
Kürzeste Wege
Unified View of Graph Searching and LDFS-Based Certifying Algorithms
Local Computation in Unstructured Radio Networks
Multilevel Feedback Queues
Succinct and Compressed Data Structures for Permutations and Integer Functions
Compact Routing Schemes
Thresholds of Random k-Sat
Combinatorial Optimization and Verification in Self-Assembly
Bin Packing with Cardinality Constraints
Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt
Server Classifications
Value Chain Analysis
Documentation for Software and IS Development
Integrated Services Digital Network (Broadband and Narrowband ISDN)
Voice Communications
Systems Analysis
User/System Interface Design
Program Design, Coding, and Testing
End-User Computing Concepts
Decision Support Systems
Database Development Process
Strategic Planning for/of Information Systems
Error Detecting and Correcting Codes
Data Modeling: Entity-Relationship Data Model
Expert Systems Construction
Electronic Mail
Crime, Use of Computers in
Copyright Laws
End-User Computing, Managing
Electronic Payment Systems
Internet Homepages
Systems Approach
Strategic Information Systems
Executive Information Systems
Network Database Systems
Telecommunications Industry
Project Management Techniques
Reengineering for Business Processes
Security Issues and Measures
Marketing Information Systems
Virtual Organizations
Resistance to Change, Managing
XML (Extensible Markup Language)
National and Regional Economic Impacts of Silicon Valley
Public Accounting Firms
SAS (Statistical Analysis System)
Globalization and Information Management Strategy
Decision-Making Approaches
Business-to-Business Electronic Commerce
Group Support Systems
Cohesion, Coupling, and Abstraction
People, Information Systems Impact on
Global Information Systems
Manual Data Processing
Systems Science
Data Warehousing and Data Marts
Service Industry
Advertising and Marketing in Electronic Commerce
Object-Oriented Databases
Enterprise Computing
Frame Relay
Human Side of Information, Managing the Systems
Industry, Artificial Intelligence in
Model Building Process
Structured Design Methodologies
Hybrid Systems
Transmission Control Protocol/Internet Protocol (TCP/IP)
Cost/Benefit Analysis
Computer-Integrated Manufacturing
Computer-Aided Manufacturing
Developing Nations
Ethical Issues in Artificial Intelligence
Future of Information Systems
Corporate Planning
Computer Hardware
Word Processing
Search Techniques
Hyper-Media Databases
Computer-Aided Design
Economic Impacts of Information Technology
Standards and Protocols in Data Communications
Data, Information, and Knowledge
Computer-Supported Cooperative Work
Structured Query Language
Goal Programming
Law Firms
Database Machines
Quality Information Systems
Control and Auditing
Staffing the Information Systems Department
Human Resource Information Systems
Knowledge Acquisition
Geographic Information Systems
Continuous Simulation
Multiplexing
Data Modeling: Object-Oriented Data Model
Natural Resource Management
Temporal Data Model and Query Language Concepts
Ethical Issues
Data Flow Diagrams
Computer Assisted Systems Engineering (CASE)
Success Measures of Information Systems
Simulation Languages
Medicine, Artificial Intelligence in